Submission #81030

#TimeUsernameProblemLanguageResultExecution timeMemory
81030arman_ferdous동굴 (IOI13_cave)C++17
12 / 100
21 ms460 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int S[N], D[N]; for(int i = 0; i < N; i++) D[i] = i; memset(S,0,sizeof S); for(;;) { int door = tryCombination(S); if(door == -1) break; S[door] = 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...