Submission #1231560

#TimeUsernameProblemLanguageResultExecution timeMemory
1231560islam_2010Cave (IOI13_cave)C++20
12 / 100
13 ms328 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; int tryCombination(int s[]); void exploreCave(int n){ int d[n], s[n]; for(int i = 0; i <= n; i++){ d[i] = i; s[i] = 0; }for(int i = 0; i <= n; i++){ int k = tryCombination(s); if(k == -1){ answer(s, d); }else if(k == i){ s[i] = 1; } }for(int i = 0; i < n; i++){ s[i] = 1; int k = tryCombination(s); d[i] = k; s[i] = 0; }answer(s, d); }
#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...