Submission #1298429

#TimeUsernameProblemLanguageResultExecution timeMemory
1298429alexiahCave (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]; int conex[n]; for(int i = 0; i < n; i++) conex[i] = i; for(int i = 0; i < n; i++) doors[i] = 0; int act = 0; while(act != -1){ act = tryCombination(doors); doors[act] = 1; } answer(doors , conex); }
#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...