#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
int min_cardinality(int n) {
int type = 0;
for (int i = 0;i < n;i++) {
move_inside(i);
if (press_button() == 2) {
move_outside(i);
}
else in[i] = 1, type++;
}
if (type == 1) return n;
if (type > n / 2) return 1;
int mxans = n / type;
int l = 1, r = mxans;
int sz = type;
while (l < r) {
int mid = (l + r + 1) / 2;
stack<int> s;
for (int i = 0;i < n;i++) {
if (sz == type * mid) break;
if (in[i]) continue;
move_inside(i);
if (press_button() > mid) move_outside(i);
else in[i] = 1, s.push(i), sz++;
}
if (sz < type * mid) {
if (r == l + 1) return l;
while (!s.empty()) {
in[s.top()] = 2;
move_outside(s.top());
sz--;
s.pop();
}
r = mid - 1;
}
else l = mid;
}
return l;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
516 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Incorrect |
2 ms |
344 KB |
Wrong answer. |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
516 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Incorrect |
2 ms |
344 KB |
Wrong answer. |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
9 ms |
344 KB |
Output is correct |
8 |
Correct |
10 ms |
436 KB |
Output is correct |
9 |
Correct |
28 ms |
592 KB |
Output is correct |
10 |
Partially correct |
32 ms |
344 KB |
Output is partially correct |
11 |
Partially correct |
64 ms |
676 KB |
Output is partially correct |
12 |
Correct |
13 ms |
600 KB |
Output is correct |
13 |
Incorrect |
42 ms |
600 KB |
Wrong answer. |
14 |
Halted |
0 ms |
0 KB |
- |