Submission #125382

#TimeUsernameProblemLanguageResultExecution timeMemory
125382khulegub동굴 (IOI13_cave)C++14
100 / 100
419 ms584 KiB
/* HEY YOU YE YOU STOP STALKING */ #include "cave.h" #include <bits/stdc++.h> int n; bool lock[5005]; int s[5005], d[5005]; void soli(int l, int r){ for (int i = l; i <= r; i++){ if(!lock[i]) s[i] = (s[i] ? 0 : 1); } } //dont know wtf is wrong?????? void exploreCave(int N) { n = N; memset(s, 0, sizeof s); memset(lock, 0, sizeof lock); for (int i = 0; i < n; i++){ if(tryCombination(s) == i) soli(0, n - 1); int l = 0, r = n - 1; while (l != r){ int mid = (l + r) >> 1; soli(l, mid); int tmp = tryCombination(s); soli(l, mid); if(tmp == i){ //zuun tald r = mid; } else{ //baruun tald l = mid + 1; } } d[l] = i; lock[l] = 1; } 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...