Submission #629256

#TimeUsernameProblemLanguageResultExecution timeMemory
629256jakubdRarest Insects (IOI22_insects)C++17
0 / 100
1 ms208 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int min_cardinality(int N) { int D = 1; vector<int> inside(N), outside(N), leader(N); move_inside(0); inside[0] = leader[0] = 1; for (int i = 1; i < N; i++) { move_inside(i); if (press_button() == 2) { move_outside(i); outside[i] = 1; } else { D++; inside[i] = leader[i] = 1; } } for (int i = 0; i < N; i++) { if (inside[i]) { move_outside(i); } } int l = 1, r = N / D, ans = N, cur = D; while (l <= r) { int m = (l + r) / 2; for (int i = 0; i < N; i++) { if (inside[i]) continue; move_inside(i); if (press_button() > m) { move_outside(i); } else { inside[i] = 1; outside[i] = 0; cur++; } } if (cur >= D * m) { l = m + 1; ans = m; } else { if (l == r) break; r = m; for (int i = 0; i < N; i++) { if (!leader[i] && inside[i]) { move_outside(i); inside[i] = 0; outside[i] = 1; } } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...