제출 #678702

#제출 시각아이디문제언어결과실행 시간메모리
678702SamNguyen동굴 (IOI13_cave)C++14
12 / 100
10 ms428 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; const int MAX = 5000 + 7; namespace Subtask1 { int swit[MAX], door[MAX]; void exploreCave(int N) { iota(door, door + N, 0); fill(swit, swit + N, 0); while (true) { int i = tryCombination(swit); if (i == -1) break; swit[i] ^= 1; } answer(swit, door); } } void exploreCave(int N) { Subtask1::exploreCave(N); }
#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...