Submission #1059497

#TimeUsernameProblemLanguageResultExecution timeMemory
1059497shiomusubi496Rarest Insects (IOI22_insects)C++17
0 / 100
223 ms412 KiB
#include "insects.h" #include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i) #define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i) #define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i) #define all(v) begin(v), end(v) #define rall(v) rbegin(v), rend(v) using namespace std; using ll = long long; template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; } template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; } int min_cardinality(int N) { rep (i, N) move_inside(i); int x = press_button(); vector<bool> flag(N, true); int cnt = -1; int ans = N; int sm = 0; rrep2 (t, 1, x + 1) { int j = -1; rep (i, N) { if (flag[i]) { move_outside(i); if (press_button() == t - 1) { j = i; flag[i] = false; break; } } } int cnt2 = 1; rep (i, j) { if (flag[i]) { move_inside(i); if (N - j - 1 < cnt2 * (t - 1)) continue; if (press_button() == t) { flag[i] = false; ++cnt2; move_outside(i); } } } sm += cnt2; if (cnt != cnt2) { cnt = cnt2; ans = t; } if ((t - 1) * cnt2 + sm == N) return ans; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...