#include<bits/stdc++.h>
#include "insects.h"
#define f first
#define s second
#define pb push_back
using namespace std;
int siz[2001]{0};
int min_cardinality(int N) {
vector<int>vec;
bool vis[2001]={0};
move_inside(0);
int sz=0;
for(int i=0;i<N;i++)siz[i]=1;
for(int i=0;i<N;i++){
if(vis[i])continue;
move_inside(i);
if(press_button()==1){
vis[i]=1;sz++;vec.pb(i);
}
else move_outside(i);
}
/*if(sz>sqrt(N)){
int now=2;
while(sz<N){
for(int i=1;i<N;i++){
if(vis[i])continue;
move_inside(i);
if(press_button()==now){
vis[i]=1;sz++;
}
else move_outside(i);
}now++;
}return now-1;
}*/
for(int i=0;i<N;i++)if(vis[i])move_outside(i);
for(int i=0;i<N;i++){
if(!vis[i]){
move_inside(i);
for(auto it : vec){
move_inside(it);
if(press_button()==2){
siz[it]++;
move_outside(i);
move_outside(it);
break;
}
else move_outside(it);
}
}
}
int ans=1e9;
for(auto it : vec){
ans=min(ans,siz[it]);
}return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 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 |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
7 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
7 ms |
344 KB |
Output is correct |
14 |
Correct |
4 ms |
344 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
344 KB |
Output is correct |
18 |
Correct |
8 ms |
344 KB |
Output is correct |
19 |
Correct |
11 ms |
344 KB |
Output is correct |
20 |
Correct |
17 ms |
344 KB |
Output is correct |
21 |
Correct |
21 ms |
344 KB |
Output is correct |
22 |
Correct |
18 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 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 |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 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 |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
7 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
7 ms |
344 KB |
Output is correct |
14 |
Correct |
4 ms |
344 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
344 KB |
Output is correct |
18 |
Correct |
8 ms |
344 KB |
Output is correct |
19 |
Correct |
11 ms |
344 KB |
Output is correct |
20 |
Correct |
17 ms |
344 KB |
Output is correct |
21 |
Correct |
21 ms |
344 KB |
Output is correct |
22 |
Correct |
18 ms |
344 KB |
Output is correct |
23 |
Correct |
8 ms |
344 KB |
Output is correct |
24 |
Correct |
4 ms |
600 KB |
Output is correct |
25 |
Correct |
72 ms |
344 KB |
Output is correct |
26 |
Correct |
88 ms |
344 KB |
Output is correct |
27 |
Correct |
8 ms |
344 KB |
Output is correct |
28 |
Correct |
7 ms |
600 KB |
Output is correct |
29 |
Correct |
18 ms |
344 KB |
Output is correct |
30 |
Correct |
74 ms |
344 KB |
Output is correct |
31 |
Correct |
14 ms |
344 KB |
Output is correct |
32 |
Correct |
21 ms |
344 KB |
Output is correct |
33 |
Correct |
34 ms |
344 KB |
Output is correct |
34 |
Correct |
39 ms |
344 KB |
Output is correct |
35 |
Correct |
41 ms |
344 KB |
Output is correct |
36 |
Correct |
58 ms |
344 KB |
Output is correct |
37 |
Correct |
131 ms |
344 KB |
Output is correct |
38 |
Incorrect |
202 ms |
344 KB |
Too many queries. |
39 |
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 |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
416 KB |
Output is correct |
7 |
Correct |
17 ms |
344 KB |
Output is correct |
8 |
Correct |
9 ms |
852 KB |
Output is correct |
9 |
Incorrect |
194 ms |
344 KB |
Too many queries. |
10 |
Halted |
0 ms |
0 KB |
- |