Submission #1298435

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