Submission #1315560

#TimeUsernameProblemLanguageResultExecution timeMemory
1315560aaaaaaaa동굴 (IOI13_cave)C++20
13 / 100
7 ms484 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int S[N], D[N]; for(int i = 0; i < N; ++i) D[i] = i, S[i] = 0; if(N == 1){ answer(S, D); return; } for(int i = 0; i < N; ++i){ S[i] ^= 1; int ans = tryCombination(S); D[i] = ans; S[i] ^= 1; } 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...