Submission #134352

#TimeUsernameProblemLanguageResultExecution timeMemory
134352arthurconmyCave (IOI13_cave)C++14
12 / 100
72 ms620 KiB
#include <bits/stdc++.h> using namespace std; #ifndef ARTHUR_LOCAL #include "cave.h" #endif void exploreCave(int n) { int D[n]; // we need to answer these int S[n]; for(int i=0; i<n; i++) { S[i]=0; D[i]=0; } vector<bool> lock(n); for(int i=0; i<n; i++) // work out door i { int cur = tryCombination(S); for(int j=0; j<n; j++) // mess with switch j { if(lock[j]) continue; S[j]=1-S[j]; if(tryCombination(S)!=cur) { if(cur!=i) S[j]=1-S[j]; lock[j]=1; D[j]=i; break; } S[j]=1-S[j]; } } 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...