Submission #134340

#TimeUsernameProblemLanguageResultExecution timeMemory
134340arthurconmyCave (IOI13_cave)C++14
0 / 100
36 ms512 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++) { D[i]=i; int cur = tryCombination(S); if(cur==i) S[i]=1-S[i]; } 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...