Submission #168128

#TimeUsernameProblemLanguageResultExecution timeMemory
168128RoundMangoCave (IOI13_cave)C++14
0 / 100
86 ms516 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; int n, door[1000000], sw[100000], l , r, mid, ans[100000], first, second; void exploreCave(int n) { for (int x = 0; x < n; x++) { first = tryCombination(door); l = 0, r = n-1; while (l != r) { mid = (l+r)/2; for (int i = l; i <= r; i++) if (!ans[i]) door[i] ^= 1; second = tryCombination(door); for (int i = l; i <= r; i++) if (!ans[i]) door[i] ^= 1; if (first == second) l = mid+1; else r = mid; } ans[l]++; sw[l] = x; if (first <= x || first != -1) door[l] = 1; } answer(sw, door); }
#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...