Submission #1141018

#TimeUsernameProblemLanguageResultExecution timeMemory
1141018AliyyiakbarCave (IOI13_cave)C++20
0 / 100
14 ms328 KiB
#include "cave.h" #include "bits/stdc++.h" using namespace std; void exploreCave(int n) { int s[n], d[n]; memset(s, 1, sizeof(d)); for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (!s[j]) continue; s[j] = 0; int query = tryCombination(s); if (query == -1 || query > i) { d[i] = j; break; } s[j] = 1; } } return answer(s, d); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...