#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int n) {
vector<bool> vis(n, false);
int ans = INT_MAX;
for(int i = 0; i < n; i++) {
if(vis[i]) continue;
vector<bool> in_set_i(n, false);
int cnt = 0;
for(int j = i; j < n; j++) {
move_inside(j);
int now = press_button();
if(now <= cnt)
move_outside(j);
else {
cnt = now;
vis[j] = true, in_set_i[j] = true;
}
}
ans = min(ans, cnt);
for(int j = i; j < n; j++) {
if(in_set_i[j])
move_outside(j);
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
262 ms |
208 KB |
Output is correct |
8 |
Correct |
27 ms |
208 KB |
Output is correct |
9 |
Correct |
20 ms |
208 KB |
Output is correct |
10 |
Correct |
4 ms |
208 KB |
Output is correct |
11 |
Correct |
43 ms |
208 KB |
Output is correct |
12 |
Correct |
11 ms |
208 KB |
Output is correct |
13 |
Correct |
26 ms |
208 KB |
Output is correct |
14 |
Correct |
15 ms |
284 KB |
Output is correct |
15 |
Correct |
16 ms |
208 KB |
Output is correct |
16 |
Correct |
15 ms |
208 KB |
Output is correct |
17 |
Correct |
22 ms |
208 KB |
Output is correct |
18 |
Correct |
30 ms |
208 KB |
Output is correct |
19 |
Correct |
40 ms |
208 KB |
Output is correct |
20 |
Correct |
50 ms |
208 KB |
Output is correct |
21 |
Correct |
87 ms |
208 KB |
Output is correct |
22 |
Correct |
136 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
262 ms |
208 KB |
Output is correct |
8 |
Correct |
27 ms |
208 KB |
Output is correct |
9 |
Correct |
20 ms |
208 KB |
Output is correct |
10 |
Correct |
4 ms |
208 KB |
Output is correct |
11 |
Correct |
43 ms |
208 KB |
Output is correct |
12 |
Correct |
11 ms |
208 KB |
Output is correct |
13 |
Correct |
26 ms |
208 KB |
Output is correct |
14 |
Correct |
15 ms |
284 KB |
Output is correct |
15 |
Correct |
16 ms |
208 KB |
Output is correct |
16 |
Correct |
15 ms |
208 KB |
Output is correct |
17 |
Correct |
22 ms |
208 KB |
Output is correct |
18 |
Correct |
30 ms |
208 KB |
Output is correct |
19 |
Correct |
40 ms |
208 KB |
Output is correct |
20 |
Correct |
50 ms |
208 KB |
Output is correct |
21 |
Correct |
87 ms |
208 KB |
Output is correct |
22 |
Correct |
136 ms |
208 KB |
Output is correct |
23 |
Correct |
13 ms |
260 KB |
Output is correct |
24 |
Incorrect |
322 ms |
208 KB |
Too many queries. |
25 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 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 |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
9 ms |
276 KB |
Output is correct |
8 |
Incorrect |
397 ms |
208 KB |
Too many queries. |
9 |
Halted |
0 ms |
0 KB |
- |