제출 #280774

#제출 시각아이디문제언어결과실행 시간메모리
280774jairRS동굴 (IOI13_cave)C++17
25 / 100
32 ms512 KiB
#include "cave.h" #include <vector> using namespace std; void exploreCave(int N) { int combination[5000]; int switches[5000]; int firstClosed = tryCombination(combination); while (firstClosed != -1) { combination[firstClosed] = combination[firstClosed] * -1 + 1; firstClosed = tryCombination(combination); } for (int i = 0; i < N; i++) { combination[i] = combination[i] * -1 + 1; int firstClosed = tryCombination(combination); switches[i] = firstClosed; combination[i] = combination[i] * -1 + 1; } answer(combination, switches); }
#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...