Submission #794411

#TimeUsernameProblemLanguageResultExecution timeMemory
794411IvanJRarest Insects (IOI22_insects)C++17
0 / 100
276 ms208 KiB
#include "insects.h" #include<bits/stdc++.h> #define pb push_back #define x first #define y second #define all(a) (a).begin(), (a).end() using namespace std; typedef long long ll; typedef pair<int, int> ii; const int maxn = 2005; int n, D, step; int vis[maxn]; int forb[maxn]; vector<ii> in; vector<int> p; int check(int x) { for(int i : p) { if(vis[i] || forb[i]) continue; move_inside(i); if(press_button() > x) move_outside(i), forb[i] = 1; else in.pb({i, step}), vis[i] = 1; if((int)in.size() == x * D) return 1; } return 0; } int min_cardinality(int N) { srand(time(0)); n = N, D = 0, step = 1; for(int i = 0;i < n;i++) p.pb(i); random_shuffle(all(p)); for(int i : p) { move_inside(i); if(press_button() > 1) move_outside(i); else in.pb({i, step}), vis[i] = 1, D++; } int lo = 1, hi = n / D, ans = 1; while(lo < hi) { step++; int mid = (lo + hi) / 2; int flag = check(mid); if(flag) { ans = mid, lo = mid; for(int i = 0;i < n;i++) forb[i] = 0; } else { hi = mid - 1; while(in.back().y == step) move_outside(in.back().x), vis[in.back().x] = 0, in.pop_back(); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...