Submission #1298424

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