Submission #696983

#TimeUsernameProblemLanguageResultExecution timeMemory
696983Elvin_FritlCave (IOI13_cave)C++17
0 / 100
2 ms340 KiB
#include "cave.h" #include <bits/stdc++.h> void exploreCave(int n) { int v[n]; memset(v,0,sizeof(v)); int res[n]; int k=tryCombination(v); if(k==-1){ for(int i=0;i<n;i++){ v[i]=1; int toto=tryCombination(v); res[i]=toto; } } answer(v,res); }
#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...