Submission #166569

#TimeUsernameProblemLanguageResultExecution timeMemory
166569dydCave (IOI13_cave)C++14
12 / 100
35 ms588 KiB
#include<bits/stdc++.h> #include "cave.h" const int MAXN=5010; int s[MAXN]; int d[MAXN]; int tryCombination(int s[]); void answer(int s[],int d[]); void exploreCave(int n){ for(int i=0;i<n;i++){ d[i]=i; if(tryCombination(s)==i) s[i]=1; } 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...