Submission #669117

#TimeUsernameProblemLanguageResultExecution timeMemory
669117allin27xRarest Insects (IOI22_insects)C++17
10 / 100
318 ms404 KiB
#include <iostream> #include <unordered_set> using namespace std; void move_inside(int i); void move_outside(int i); int press_button(); int min_cardinality(int N){ int res = 2000; unordered_set<int> ins; for (int i=0; i<N; i++) ins.insert(i); while (!ins.empty()){ unordered_set<int> nins; int r = 1; int b = -1; for (auto i: ins){ if (b==-1){ b=i; move_inside(i); continue; } move_inside(i); if (press_button() == 2) r++; else nins.insert(i); move_outside(i); } move_outside(b); res = min(res, r); ins = nins; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...