Submission #207763

#TimeUsernameProblemLanguageResultExecution timeMemory
207763a_playerCave (IOI13_cave)C++14
13 / 100
21 ms512 KiB
#include "cave.h" #include <bits/stdc++.h> #define try tryCombination using namespace std; const int MAXN = 5e3+5; int S[MAXN]; int D[MAXN]; void exploreCave(int N) { for(int i=0;i<N;i++){ S[i]=1; D[i]=try(S); S[i]=0; } 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...