| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1310685 | gabrielz | 동굴 (IOI13_cave) | C++20 | 1 ms | 568 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
vector<int> truth, cr(N);
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
vector<int> tr{0}; tr[j] = 1;
if (i == tryCombination(tr.data())) {
truth.push_back(j);
cr[j] = i;
}
}
}
answer(truth.data(), cr.data());
}
| # | 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... | ||||
