Submission #640848

#TimeUsernameProblemLanguageResultExecution timeMemory
640848TimDeeRarest Insects (IOI22_insects)C++17
0 / 100
4 ms208 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int n; int min_cardinality(int N) { n=N; int d=0; vector<int> in(n,0); for(int i=0; i<n; ++i) { move_inside(i); int x=press_button(); if (x>1) move_outside(i); else { in[i]=1; ++d; } } if (d==1) return n; if (d<=8) { int ans=n; vector<int> vis(n,0); for (int i=0; i<d; ++i) { int cnt=0; for (int i=0; i<n; ++i) { if (vis[i]) continue; move_inside(i); int x=press_button(); if (x==cnt) move_outside(i); else { ++cnt; vis[i]=1; } } ans=min(ans,cnt); } return ans; } int l=1, r=n/d; while (l<r) { int mid=(l+r+1)>>1; int extra=0; int cnt=0; for (int i=0; i<n; ++i) { if (in[i]) continue; move_inside(i); int x=press_button(); if (x>mid) { extra=1; move_outside(i); } else ++cnt; in[i]=1; } if (cnt==mid*d) { if (extra==0) { return mid; } else { l=mid; } } else { r=mid-1; } } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...