Submission #571937

#TimeUsernameProblemLanguageResultExecution timeMemory
571937VanillaCave (IOI13_cave)C++17
0 / 100
201 ms400 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int s[n] = {}, d[n] = {}; int used [n] = {}; for (int i = 0; i < n; i++) { s[i] = 0; } for (int door = 0; door < n; door++){ for (int sw = 0; sw < n; sw++){ if (used[sw]) continue; int k = tryCombination(s); if (k == door) { used[sw] = 1; s[sw] = !s[sw]; d[sw] = door; } } } 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...