Submission #72698

#TimeUsernameProblemLanguageResultExecution timeMemory
72698RezwanArefin01Cave (IOI13_cave)C++17
25 / 100
27 ms620 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int S[N], D[N]; memset(S, 0, sizeof S); if(tryCombination(S) == -1) { for(int i = 0; i < N; i++) { S[i] = 1; D[i] = tryCombination(S); S[i] = 0; } answer(S, D); } for(int i = 0; i < N; i++) { int x = tryCombination(S); if(x == -1) break; if(x <= i) S[i] ^= 1; } for(int i = 0; i < N; i++) D[i] = i; 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...