Submission #1216683

#TimeUsernameProblemLanguageResultExecution timeMemory
1216683giorgi123glmCave (IOI13_cave)C++20
13 / 100
9 ms520 KiB
#include "cave.h" #include <iostream> #include <mutex> #include <vector> using namespace std; void exploreCave(int N) { vector <int> comb (N); for (int i = 0; i < N; i++) { vector <int> giv (N); giv[i] = 1; int get = tryCombination (giv.data()); comb[i] = get; } answer ((vector <int> (N, 0)).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...