Submission #316524

#TimeUsernameProblemLanguageResultExecution timeMemory
316524nandonathanielCave (IOI13_cave)C++14
12 / 100
36 ms512 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; int hai=tryCombination(S); if(hai>i || hai==-1)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...