Submission #519141

#TimeUsernameProblemLanguageResultExecution timeMemory
519141JomnoiCave (IOI13_cave)C++17
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> #include "cave.h" #define DEBUG 0 using namespace std; const int MX = 5e3 + 10; int S[MX], D[MX]; void exploreCave(int N) { for(int i = 0; i < N; i++) { int res = tryCombination(S); if(res != i + 1) { S[i] = 1; } } for(int i = 0; i < N; i++) { D[i] = i; } 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...