Submission #1216675

#TimeUsernameProblemLanguageResultExecution timeMemory
1216675giorgi123glmCave (IOI13_cave)C++20
12 / 100
13 ms328 KiB
#include "cave.h" #include <iostream> #include <vector> using namespace std; void exploreCave(int N) { vector <int> ans (N); for (int i = 0; i < N; i++) { int res = tryCombination (ans.data()); if (res == -1) res = 2e9; if (res > i) { continue; } else { ans[i] = 1; } } vector <int> comb (N); for (int i = 0; i < N; i++) comb[i] = i; answer (ans.data(), comb.data()); }
#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...