#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 99999999999999
int min_cardinality(int N)
{
ll n=N;
vector<int>type(n,-1);
vector<int>count(n,1);
ll ans=INF;
set<int>s;
vector<int>v;
for(int i=0;i<N;i++)
{
move_inside(i);
ll p=press_button();
if(p!=1)
move_outside(i);
else
{
type[i]=i;
v.pb(i);
}
}
for(int i=0;i<N;i++)
move_outside(i);
for(int i=0;i<N;i++)
if(type[i]==-1)
{
ll l=0,r=v.size()-1;
move_inside(i);
while(l<r)
{
ll mid=(l+r)/2;
for(int j=l;j<=mid;j++)
move_inside(v[j]);
ll p=press_button();
for(int j=l;j<=mid;j++)
move_outside(v[j]);
if(p!=1)
r=mid;
else
l=mid+1;
}
move_outside(i);
count[v[l]]++;
}
for(auto x:v)
ans=min(ans,(ll)count[x]);
return ans;
}
# |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
3 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
9 ms |
208 KB |
Output is correct |
9 |
Correct |
6 ms |
208 KB |
Output is correct |
10 |
Correct |
4 ms |
332 KB |
Output is correct |
11 |
Correct |
10 ms |
208 KB |
Output is correct |
12 |
Correct |
6 ms |
208 KB |
Output is correct |
13 |
Correct |
9 ms |
208 KB |
Output is correct |
14 |
Correct |
6 ms |
332 KB |
Output is correct |
15 |
Correct |
8 ms |
208 KB |
Output is correct |
16 |
Correct |
5 ms |
208 KB |
Output is correct |
17 |
Correct |
7 ms |
404 KB |
Output is correct |
18 |
Correct |
7 ms |
208 KB |
Output is correct |
19 |
Correct |
7 ms |
208 KB |
Output is correct |
20 |
Correct |
11 ms |
208 KB |
Output is correct |
21 |
Correct |
11 ms |
332 KB |
Output is correct |
22 |
Correct |
8 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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
3 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
208 KB |
Output is correct |
8 |
Correct |
9 ms |
208 KB |
Output is correct |
9 |
Correct |
6 ms |
208 KB |
Output is correct |
10 |
Correct |
4 ms |
332 KB |
Output is correct |
11 |
Correct |
10 ms |
208 KB |
Output is correct |
12 |
Correct |
6 ms |
208 KB |
Output is correct |
13 |
Correct |
9 ms |
208 KB |
Output is correct |
14 |
Correct |
6 ms |
332 KB |
Output is correct |
15 |
Correct |
8 ms |
208 KB |
Output is correct |
16 |
Correct |
5 ms |
208 KB |
Output is correct |
17 |
Correct |
7 ms |
404 KB |
Output is correct |
18 |
Correct |
7 ms |
208 KB |
Output is correct |
19 |
Correct |
7 ms |
208 KB |
Output is correct |
20 |
Correct |
11 ms |
208 KB |
Output is correct |
21 |
Correct |
11 ms |
332 KB |
Output is correct |
22 |
Correct |
8 ms |
208 KB |
Output is correct |
23 |
Correct |
9 ms |
208 KB |
Output is correct |
24 |
Correct |
8 ms |
208 KB |
Output is correct |
25 |
Correct |
49 ms |
208 KB |
Output is correct |
26 |
Correct |
49 ms |
208 KB |
Output is correct |
27 |
Correct |
17 ms |
208 KB |
Output is correct |
28 |
Incorrect |
24 ms |
208 KB |
Too many queries. |
29 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
1 ms |
332 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 |
Partially correct |
1 ms |
208 KB |
Output is partially correct |
7 |
Correct |
19 ms |
296 KB |
Output is correct |
8 |
Correct |
17 ms |
312 KB |
Output is correct |
9 |
Incorrect |
42 ms |
208 KB |
Too many queries. |
10 |
Halted |
0 ms |
0 KB |
- |