Submission #641255

#TimeUsernameProblemLanguageResultExecution timeMemory
641255TimDeeRarest Insects (IOI22_insects)C++17
99.89 / 100
62 ms336 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int n,d; vector<int> in(2005,0); vector<int> uniq; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int min_cardinality(int N) { n=N; d=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; } } for (int i=0; i<n; ++i) if (in[i]) uniq.push_back(i); if (d==1) return n; if (d>n/2) return 1; /*if (d<=2) { int ans=n; vector<int> vis(n,0); for (int i=0; i<n; ++i) vis[i]=in[i]; for (int i=0; i<d; ++i) { vector<int> bulaneala; int cnt=1; 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 { bulaneala.push_back(i); ++cnt; vis[i]=1; } } ans=min(ans,cnt); for (auto x:bulaneala) move_outside(x); } return ans; }*/ int l=1, r=n/d; int now=d; vector<int> use; for (int i=0; i<n; ++i) { if (in[i]) continue; use.push_back(i); } while (l<r) { vector<int> add; int mid=(l+r+1)>>1; int extra=0; int cnt=now; shuffle(use.begin(), use.end(),rng); for (auto x:use) { if (in[x]) continue; in[x]=1; move_inside(x); int X=press_button(); if (X>mid) { extra=1; move_outside(x); in[x]=0; } else { ++cnt; add.push_back(x); } } if (cnt==mid*d) { if (extra==0) { return mid; } else { l=mid; now=cnt; } } else { now=cnt; r=mid-1; use=add; for (auto x:add) { --now; in[x]=0; move_outside(x); } } } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...