Submission #316522

#TimeUsernameProblemLanguageResultExecution timeMemory
316522nandonathanielCave (IOI13_cave)C++14
0 / 100
11 ms384 KiB
#include "cave.h" #include "bits/stdc++.h" using namespace std; const int MAXN=5005; int S[MAXN],arr[MAXN]; void exploreCave(int N) { for(int i=0;i<N;i++){ arr[i]=i; S[i]=0; if(tryCombination(S)>i)continue; else S[i]=1; } answer(S,arr); }
#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...