Submission #741784

#TimeUsernameProblemLanguageResultExecution timeMemory
741784pzorroCave (IOI13_cave)C++14
12 / 100
8 ms428 KiB
#include <iostream> #include <bits/stdc++.h> #include "cave.h" using namespace std; const int MAXN = 5 * 1e3; int s[MAXN]; int d[MAXN]; int troca(int n){ if(n) return 0; return 1; } void exploreCave(int n){ for(int i = 0; i < n; i++){ s[i] = 0; d[i] = i; } int res; while(1){ res = tryCombination(s); if(res == -1) answer(s, d); s[res] = troca(s[res]); } }
#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...