Submission #456253

#TimeUsernameProblemLanguageResultExecution timeMemory
456253osmanallazovCave (IOI13_cave)C++14
13 / 100
16 ms384 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int s[N],d[N]; memset(s, 0, sizeof s); if(tryCombination(s)==-1) { for(int i=0;i<N;i++) { s[i]=1; d[i]=tryCombination(s); s[i]=0; } answer(s,d); } for(int i=0;i<N;i++) { int x=tryCombination(s); if(x==-1) break; if(x<=i) s[i]^=1; } for(int i=0;i<N;i++) d[i]=i; answer(d,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...