Submission #1240539

#TimeUsernameProblemLanguageResultExecution timeMemory
1240539Jer동굴 (IOI13_cave)C++20
12 / 100
6 ms328 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int s[n], d[n]; for (int i = 0; i < n; i++) d[i] = i, s[i] = 0; int curr = 0; while (true) { curr = tryCombination(s); if (curr == -1) break; s[curr] = 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...