Submission #1237530

#TimeUsernameProblemLanguageResultExecution timeMemory
1237530SG2AlokCave (IOI13_cave)C++20
13 / 100
9 ms328 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int a[N], ans[N]; for(int i = 0; i < N; i++) a[i] = 0, ans[i] = -1; int cur = tryCombination(a); while(cur != -1){ int l = 0, r = N - 1; while(l <= r){ int mid = (l + r) / 2; bool lf = false; for(int i = l; i <= mid; i++){ if(ans[i] != -1) continue; a[i] = 1 - a[i]; int judges = tryCombination(a); if(judges > cur || judges == -1){ lf = true; ans[i] = cur; cur = judges; break; } } if(lf){ break; } else { l = mid + 1; } } } for(int i = 0; i < N; i++){ if(ans[i] == -1){ a[i] = 1 - a[i]; ans[i] = tryCombination(a); a[i] = 1 - a[i]; } } answer(a, ans); }
#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...