Submission #1298520

#TimeUsernameProblemLanguageResultExecution timeMemory
1298520alexiahCave (IOI13_cave)C++20
0 / 100
170 ms516 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int n) { int comb[n]; int conex[n]; int vis[n]; for(int i = 0; i < n; i++){ comb[i] = 0; conex[i] = -1; vis[i] = 0; } for(int i = 0; i < n; i++){ int swiid = -1; for(int j = 0; j < n; j++){ if(vis[j]) continue; int aux = comb[j]; comb[j] = 0; int act = tryCombination(comb); comb[j] = aux; if(act == i){ swiid = j; break; } } vis[swiid] = 1; conex[swiid] = i; int aux = comb[swiid]; comb[swiid] = 0; int act = tryCombination(comb); if(!(act == -1 || act > i)) comb[swiid] = 1; } answer(comb , 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...