Submission #1228835

#TimeUsernameProblemLanguageResultExecution timeMemory
1228835ericl23302Rarest Insects (IOI22_insects)C++20
10 / 100
98 ms408 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int min_cardinality(int N) { vector<bool> erased(N, false); int least = 1e9, cur = 1; for (int i = 0; i < N; ++i) { if (erased[i]) continue; move_inside(i); cur = 1; for (int j = i + 1; j < N; ++j) { if (erased[j]) continue; move_inside(j); int ans = press_button(); if (ans == 2) { ++cur; erased[j] = true; } move_outside(j); } move_outside(i); if (cur < least) least = cur; if (least == 1) return 1; } return least; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...