Submission #882318

#TimeUsernameProblemLanguageResultExecution timeMemory
882318dubabubaCave (IOI13_cave)C++14
0 / 100
196 ms516 KiB
#include "cave.h" #include <bits/stdc++.h> const int mxn = 5050; void exploreCave(int N) { int d[N], id[N]; memset(d, 0, sizeof d); while(1) { int i = tryCombination(d); d[i] = 1; } for(int i = 0; i < N; i++) id[i] = i; answer(d, id); }
#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...