#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N){
vector<pair<int,int>> current;
vector<vector<int>> types;
for(int i=0;i<N;i++) {
move_inside(i);
if(press_button()==1) {
current.emplace_back(i,types.size());
types.emplace_back();
types.back().emplace_back(i);
continue;
}
for(auto&[x,y]:current) {
move_outside(x);
if(press_button()==1) {
types[y].emplace_back(i);
}
move_inside(x);
}
move_outside(i);
}
int siz = N;
for(auto&i:types)siz=min(siz,(int)i.size());
return siz;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
3 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
13 ms |
440 KB |
Output is correct |
9 |
Correct |
20 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
23 ms |
416 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
436 KB |
Output is correct |
14 |
Correct |
5 ms |
340 KB |
Output is correct |
15 |
Correct |
7 ms |
344 KB |
Output is correct |
16 |
Correct |
9 ms |
432 KB |
Output is correct |
17 |
Correct |
13 ms |
344 KB |
Output is correct |
18 |
Correct |
15 ms |
344 KB |
Output is correct |
19 |
Correct |
19 ms |
600 KB |
Output is correct |
20 |
Correct |
31 ms |
344 KB |
Output is correct |
21 |
Correct |
42 ms |
340 KB |
Output is correct |
22 |
Correct |
45 ms |
428 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
3 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
13 ms |
440 KB |
Output is correct |
9 |
Correct |
20 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
23 ms |
416 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
436 KB |
Output is correct |
14 |
Correct |
5 ms |
340 KB |
Output is correct |
15 |
Correct |
7 ms |
344 KB |
Output is correct |
16 |
Correct |
9 ms |
432 KB |
Output is correct |
17 |
Correct |
13 ms |
344 KB |
Output is correct |
18 |
Correct |
15 ms |
344 KB |
Output is correct |
19 |
Correct |
19 ms |
600 KB |
Output is correct |
20 |
Correct |
31 ms |
344 KB |
Output is correct |
21 |
Correct |
42 ms |
340 KB |
Output is correct |
22 |
Correct |
45 ms |
428 KB |
Output is correct |
23 |
Correct |
10 ms |
344 KB |
Output is correct |
24 |
Correct |
8 ms |
756 KB |
Output is correct |
25 |
Correct |
206 ms |
672 KB |
Output is correct |
26 |
Correct |
206 ms |
416 KB |
Output is correct |
27 |
Correct |
14 ms |
344 KB |
Output is correct |
28 |
Incorrect |
292 ms |
848 KB |
Too many queries. |
29 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 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 |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
28 ms |
440 KB |
Output is correct |
8 |
Correct |
11 ms |
540 KB |
Output is correct |
9 |
Incorrect |
283 ms |
928 KB |
Too many queries. |
10 |
Halted |
0 ms |
0 KB |
- |