Submission #654954

#TimeUsernameProblemLanguageResultExecution timeMemory
654954sandry24Cave (IOI13_cave)C++17
0 / 100
37 ms388 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pi; #define pb push_back #define mp make_pair #define f first #define s second void exploreCave(int N){ int s[N], d[N]; vector<bool> checked(N); for(int i = 0; i < N; i++){ int l = 0, r = N-1; int f_ans = tryCombination(s); while(l != r){ int temp[N]; for(int j = 0; j < N; j++) temp[i] = s[i]; int mid = (l+r)/2; for(int j = l; j <= mid; j++){ if(checked[j]) continue; temp[j] = !s[j]; } int ans = tryCombination(temp); if(ans != f_ans) r = mid; else l = mid+1; } d[i] = l; checked[l] = 1; if(f_ans == i) s[l] = !s[l]; } 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...