Submission #254160

#TimeUsernameProblemLanguageResultExecution timeMemory
254160AaronNaiduCave (IOI13_cave)C++14
12 / 100
17 ms544 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; int N; void exploreCave(int n) { int s[n]; int d[n]; for (int i = 0; i < n; i++) { s[i] = 0; d[i] = i; } for (int i = 0; i < n; i++) { s[i] = 1; int x = tryCombination(s); if (x == i) { s[i] = 0; } } 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...