Submission #647869

#TimeUsernameProblemLanguageResultExecution timeMemory
647869TruitadepatatesCave (IOI13_cave)C++14
25 / 100
10 ms428 KiB
#include <bits/stdc++.h> using namespace std; #include "cave.h" void exploreCave(int n) { int S[n]; int D[n]; for (int i = 0; i < n; i++){ S[i] = 0; } int a = tryCombination(S); if (a == -1){ for (int i = 0; i < n; i++){ S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } } else{ for (int i = 0; i < n; i++){ D[i] = i; } while (a < n) { S[a] = 1; a = tryCombination(S); if (a == -1) break; } } 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...