Submission #306324

#TimeUsernameProblemLanguageResultExecution timeMemory
306324amunduzbaev동굴 (IOI13_cave)C++14
0 / 100
4 ms384 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int v[n],ans[n]; memset(v,0,sizeof(v)); for(int i=0;i<n;i++){ ans[i]=i; } int cor = tryCombination(v); while(cor!=-1){ v[cor]=1; tryCombination(v); } answer(v,ans); }
#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...