| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1187681 | nagorn_ph | 동굴 (IOI13_cave) | C++20 | 12 ms | 512 KiB |
// subtask 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
