Submission #282836

#TimeUsernameProblemLanguageResultExecution timeMemory
282836ShushCave (IOI13_cave)C++17
12 / 100
14 ms384 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; int n, *s, *t; void exploreCave(int N) { n = N; s = new int[n]; t = new int[n]; for(int i = 0; i < n; i++){ t[i] = i; s[i] = 0; } for(int i = 0; i < n; i++){ int c = tryCombination(s); if(c == -1) break; s[c] = 1 - s[c]; } answer(s, t); }
#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...