제출 #507181

#제출 시각아이디문제언어결과실행 시간메모리
507181amukkalirCave (IOI13_cave)C++17
0 / 100
1 ms332 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int S[N], D[N]; for(int i=0; i<N; i++){ S[i] = 0; D[i] = i; } for(int i=0; i<N; i++) { int rep = tryCombination(S); S[i] = (rep != (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...