Submission #342389

#TimeUsernameProblemLanguageResultExecution timeMemory
342389MilosMilutinovic동굴 (IOI13_cave)C++14
25 / 100
37 ms748 KiB
/** * author: milos * created: 02.01.2021 04:44:44 **/ #include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int p[n]; for (int i = 0; i < n; i++) { p[i] = 0; } int x = tryCombination(p); int ans[n]; if (x == -1) { for (int i = 0; i < n; i++) { p[i] = 1; ans[i] = tryCombination(p); p[i] = 0; } } else { for (int i = 0; i < n; i++) { ans[i] = i; } for (int i = 0; i < n; i++) { if (tryCombination(p) == i) { p[i] = 1; } } } answer(p, 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...