제출 #1002142

#제출 시각아이디문제언어결과실행 시간메모리
1002142overwatch9동굴 (IOI13_cave)C++17
12 / 100
10 ms856 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { vector <int> need_to_find; for (int i = 0; i < N; i++) need_to_find.push_back(i); int s[N+1], d[N+1]; for (int i = 0; i < N; i++) d[i] = i; for (int i = 0; i < N; i++) { s[i] = 1; int res = tryCombination(s); if (res == i) s[i] = 0; else 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...