Submission #76266

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
#pragma region
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) \
Type __VA_ARGS__; \
input(__VA_ARGS__)
#define let const auto
constexpr size_t operator""_zu(unsigned long long value) {
return value;
};
constexpr intmax_t operator""_jd(unsigned long long value) {
return value;
};
constexpr uintmax_t operator""_ju(unsigned long long value) {
return value;
};
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream& is, Container& vs) {
for (auto& v: vs) is >> v;
return is;
}
template <class T, class U>
inline istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >> p.second;
return is;
}
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream& os, const Container& vs) {
static constexpr const char* delim[] = {" ", ""};
for (auto it = begin(vs); it != end(vs); ++it) {
os << delim[it == begin(vs)] << *it;
}
return os;
}
inline void output() {
cout << "\n";
}
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail)) cout << " ";
output(forward<Tail>(tail)...);
}
template <class Iterator>
inline void join(const Iterator& Begin, const Iterator& End, const string& delim = "\n",
const string& last = "\n") {
for (auto it = Begin; it != End; ++it) {
cout << ((it == Begin) ? "" : delim) << *it;
}
cout << last;
}
template <class T>
inline vector<T> makeVector(const T& init_value, size_t sz) {
return vector<T>(sz, init_value);
}
template <class T, class... Args>
inline auto makeVector(const T& init_value, size_t sz, Args... args) {
return vector<decltype(makeVector<T>(init_value, args...))>(
sz, makeVector<T>(init_value, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func> {forward<Func>(f)};
}
template <class Container>
struct reverse_t {
Container& c;
reverse_t(Container& c) : c(c) {}
auto begin() {
return c.rbegin();
}
auto end() {
return c.rend();
}
};
template <class Container>
auto reversed(Container& c) {
return reverse_t<Container>(c);
}
template <class T>
inline bool chmax(T& a, const T& b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T& a, const T& b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T& a, const T& b) noexcept {
return a < b ? b - a : a - b;
}
template <class T>
inline T sigma(const T& l, const T& r) noexcept {
return (l + r) * (r - l + 1) / 2;
}
template <class T>
inline T div_floor(T a, T b) noexcept {
if (b < 0) a = -a, b = -b;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
inline T div_ceil(T a, T b) noexcept {
if (b < 0) a = -a, b = -b;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
void operator|=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs | rhs;
}
void operator&=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs & rhs;
}
void operator^=(vector<bool>::reference lhs, const bool rhs) {
lhs = lhs ^ rhs;
}
void ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
// my_binary_search {{{
template <class Tp, class Func>
Tp my_binary_search(Tp ok, Tp ng, const Func& f) {
while (std::abs(ok - ng) > 1) {
const Tp mid = std::min(ok, ng) + std::abs(ok - ng) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
// }}}
int main() {
ioinit();
var(size_t, N, M, Q);
assert(1 <= N && N <= 200'000);
assert(1 <= M && M <= 200'000);
assert(1 <= Q && Q <= 200'000);
vector<intmax_t> as(N);
for (auto&& a: as) {
input(a);
assert(1 <= a && a <= N);
}
sort(all(as));
rep(_, 0, Q) {
var(size_t, k);
assert(1 <= k && k <= N * M);
const auto f = [&](intmax_t x) {
const auto pos = lower_bound(all(as), x);
return M * (pos - as.begin()) < k;
};
const auto res = my_binary_search(0_jd, LINF, f);
output(res);
}
return 0;
}

ステータス

項目 データ
問題 1660 - Find Kth
ユーザー名 もけ
投稿日時 2023-09-21 16:20:08
言語 C++17
状態 Accepted
得点 2
ソースコード長 6068 Byte
最大実行時間 454 ms
最大メモリ使用量 13588 KB

セット

セット 得点 Cases
1 ALL 2 / 2 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
00_sample_00.in AC 24 ms 604 KB
1
01_small_00.in AC 20 ms 432 KB
1
01_small_01.in AC 25 ms 516 KB
1
01_small_02.in AC 20 ms 472 KB
1
01_small_03.in AC 23 ms 432 KB
1
01_small_04.in AC 24 ms 516 KB
1
02_corner_minimum_00.in AC 16 ms 476 KB
1
02_corner_minimum_01.in AC 20 ms 556 KB
1
02_corner_minimum_02.in AC 15 ms 640 KB
1
03_general_00.in AC 24 ms 596 KB
1
03_general_01.in AC 23 ms 680 KB
1
04_random_00.in AC 24 ms 508 KB
1
04_random_01.in AC 20 ms 460 KB
1
04_random_02.in AC 26 ms 544 KB
1
05_large_00.in AC 29 ms 500 KB
1
05_large_01.in AC 16 ms 588 KB
1
05_large_02.in AC 18 ms 528 KB
1
05_large_03.in AC 25 ms 596 KB
1
06_corner_maximum_00.in AC 380 ms 3068 KB
1
06_corner_maximum_01.in AC 70 ms 1968 KB
1
06_corner_maximum_02.in AC 454 ms 4860 KB
1
07_corner_critical_00.in AC 143 ms 4012 KB
1
07_corner_critical_01.in AC 333 ms 6520 KB
1
07_corner_critical_02.in AC 259 ms 7724 KB
1
07_corner_critical_03.in AC 271 ms 9052 KB
1
07_corner_critical_04.in AC 435 ms 10384 KB
1
07_corner_critical_05.in AC 432 ms 11580 KB
1
07_corner_critical_06.in AC 435 ms 12776 KB
1
07_corner_critical_07.in AC 252 ms 13588 KB
1