#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
const int maxn = 2010;
bool in[maxn];
pair<bool, int> p(int x, int N) {
for (int i = 0; i < N; ++i) {
move_inside(i);
in[i] = 1;
if (press_button() > x) {
move_outside(i);
in[i] = 0;
}
}
for (int i = 0; i < N; ++i) {
if (in[i]) {
move_outside(i);
}
}
int cnt = 0, bad = 0;
for (int i = 0; i < N; ++i) {
if (in[i]) {
move_inside(i);
if (press_button() >= x) {
move_outside(i);
in[i] = 0;
bad += 1;
}
cnt += 1;
}
}
for (int i = 0; i < N; ++i) {
if (in[i]) {
move_outside(i);
in[i] = 0;
}
}
return {cnt == bad * x, bad};
}
int min_cardinality(int N) {
pair<bool, int> temp;
int lo = 1, hi = N;//min(N, 1000);
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
if ((temp = p(mid, N)).first) lo = mid;
else hi = mid-1;
}
//if (lo == 1000 && temp.second == 1) return N;
return lo;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
24 ms |
208 KB |
Output is correct |
7 |
Correct |
24 ms |
208 KB |
Output is correct |
8 |
Correct |
24 ms |
208 KB |
Output is correct |
9 |
Correct |
19 ms |
208 KB |
Output is correct |
10 |
Correct |
14 ms |
208 KB |
Output is correct |
11 |
Correct |
17 ms |
208 KB |
Output is correct |
12 |
Correct |
20 ms |
208 KB |
Output is correct |
13 |
Correct |
12 ms |
208 KB |
Output is correct |
14 |
Correct |
22 ms |
208 KB |
Output is correct |
15 |
Correct |
26 ms |
208 KB |
Output is correct |
16 |
Correct |
21 ms |
208 KB |
Output is correct |
17 |
Correct |
17 ms |
208 KB |
Output is correct |
18 |
Correct |
25 ms |
208 KB |
Output is correct |
19 |
Correct |
23 ms |
208 KB |
Output is correct |
20 |
Correct |
20 ms |
208 KB |
Output is correct |
21 |
Correct |
26 ms |
208 KB |
Output is correct |
22 |
Correct |
27 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
24 ms |
208 KB |
Output is correct |
7 |
Correct |
24 ms |
208 KB |
Output is correct |
8 |
Correct |
24 ms |
208 KB |
Output is correct |
9 |
Correct |
19 ms |
208 KB |
Output is correct |
10 |
Correct |
14 ms |
208 KB |
Output is correct |
11 |
Correct |
17 ms |
208 KB |
Output is correct |
12 |
Correct |
20 ms |
208 KB |
Output is correct |
13 |
Correct |
12 ms |
208 KB |
Output is correct |
14 |
Correct |
22 ms |
208 KB |
Output is correct |
15 |
Correct |
26 ms |
208 KB |
Output is correct |
16 |
Correct |
21 ms |
208 KB |
Output is correct |
17 |
Correct |
17 ms |
208 KB |
Output is correct |
18 |
Correct |
25 ms |
208 KB |
Output is correct |
19 |
Correct |
23 ms |
208 KB |
Output is correct |
20 |
Correct |
20 ms |
208 KB |
Output is correct |
21 |
Correct |
26 ms |
208 KB |
Output is correct |
22 |
Correct |
27 ms |
208 KB |
Output is correct |
23 |
Correct |
179 ms |
208 KB |
Output is correct |
24 |
Correct |
156 ms |
320 KB |
Output is correct |
25 |
Correct |
153 ms |
208 KB |
Output is correct |
26 |
Correct |
122 ms |
208 KB |
Output is correct |
27 |
Correct |
82 ms |
208 KB |
Output is correct |
28 |
Correct |
59 ms |
280 KB |
Output is correct |
29 |
Correct |
122 ms |
208 KB |
Output is correct |
30 |
Correct |
105 ms |
208 KB |
Output is correct |
31 |
Correct |
157 ms |
208 KB |
Output is correct |
32 |
Correct |
175 ms |
208 KB |
Output is correct |
33 |
Correct |
135 ms |
328 KB |
Output is correct |
34 |
Correct |
129 ms |
284 KB |
Output is correct |
35 |
Correct |
151 ms |
208 KB |
Output is correct |
36 |
Correct |
161 ms |
208 KB |
Output is correct |
37 |
Correct |
99 ms |
284 KB |
Output is correct |
38 |
Correct |
173 ms |
208 KB |
Output is correct |
39 |
Correct |
146 ms |
208 KB |
Output is correct |
40 |
Correct |
136 ms |
208 KB |
Output is correct |
41 |
Correct |
173 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Partially correct |
1 ms |
208 KB |
Output is partially correct |
6 |
Partially correct |
1 ms |
208 KB |
Output is partially correct |
7 |
Incorrect |
377 ms |
420 KB |
Too many queries. |
8 |
Halted |
0 ms |
0 KB |
- |