Submission #1298437

#TimeUsernameProblemLanguageResultExecution timeMemory
1298437alexiahCave (IOI13_cave)C++20
13 / 100
7 ms348 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int comb[n]; vector<int> conex (n); for(int i = 0; i < n; i++) comb[i] = 0; for(int i = 0; i < n; i++){ comb[i] = 1; int act = tryCombination(comb); conex[i] = act; comb[i] = 0; } int uni[n]; for(int i = 0; i < n; i++){ uni[i] = conex[i]; } answer(comb , uni); }
#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...