#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
using vi = vector<int>;
int D, inside[3000];
int min_cardinality(int n) {
for(int i = 0; i < n; i++){
move_inside(i);
if(press_button()>1) move_outside(i);
else inside[i]=1, D++;
}
if(D==1) return n;
if(D==n) return 1;
int l = 1, r = n/D, p=1, tot=D,ans=1;
while(l<r){
int mid = (l+r+0.5)/2;
for(int i = 0; i < n; i++)
if(inside[i] >= mid and mid<=p)
move_outside(i), inside[i]=0, tot--;
for(int i = 0; i < n; i++){
if(!!inside[i] or tot==D*mid) continue; move_inside(i);
if(press_button()>mid) move_outside(i);
else inside[i]=mid, tot++;
}
if(tot==D*mid) ans=l,l = mid+1;
else{
for(int i = 0; i < n; i++)
if(!inside[i]) inside[i]=-1;
r=mid-1;
}
p=mid;
}
return ans;
}
Compilation message
insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:25:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
25 | if(!!inside[i] or tot==D*mid) continue; move_inside(i);
| ^~
insects.cpp:25:53: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
25 | if(!!inside[i] or tot==D*mid) continue; move_inside(i);
| ^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
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 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
5 |
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 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
5 |
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 |
344 KB |
Output is correct |
7 |
Correct |
11 ms |
344 KB |
Output is correct |
8 |
Correct |
9 ms |
600 KB |
Output is correct |
9 |
Incorrect |
17 ms |
436 KB |
Wrong answer. |
10 |
Halted |
0 ms |
0 KB |
- |