제출 #429466

#제출 시각아이디문제언어결과실행 시간메모리
429466dariascCave (IOI13_cave)C++14
12 / 100
12 ms464 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int ans[N]; memset(ans, 0, sizeof ans); for (int i = 0; i < N; i++) { ans[i] = 1; if (i == tryCombination(ans)) { ans[i] = 0; } else { ans[i] = 1; } } int conn[N]; for (int i = 0; i < N; i++) { conn[i] = i; } answer(ans, conn); }
#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...