제출 #1187680

#제출 시각아이디문제언어결과실행 시간메모리
1187680nagorn_phCave (IOI13_cave)C++20
0 / 100
43 ms1856 KiB
// sub 1 #include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int n) { int a[n], p[n]; for (int i = 0; i < n; i++) a[i] = 0, p[i] = i; int idx = 0; while (idx < n) { int f = tryCombination(a); if (f == -1) break; cout << idx << ": "; for (int i = 0; i < n; i++) cout << a[i] << " "; cout << ": " << f << "\n"; if (f > idx) idx = f; else a[idx] = !a[idx]; } answer(a, p); }
#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...