Submission #492906

#TimeUsernameProblemLanguageResultExecution timeMemory
492906aris12345678Cave (IOI13_cave)C++14
12 / 100
9 ms420 KiB
#include <bits/stdc++.h> // #include "graderlib.cpp" #include "cave.h" using namespace std; const int mxN = 5005; void exploreCave(int n) { int doors[n]; int pos[n]; fill(doors, doors+n, 0); iota(pos, pos+n, 0); while(true) { int first = tryCombination(doors); if(first == -1) break; else doors[first] = !doors[first]; } answer(doors, pos); } // int main() { // int N = init(); // exploreCave(N); // return 0; // }
#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...