| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1141018 | Aliyyiakbar | Cave (IOI13_cave) | C++20 | 14 ms | 328 KiB |
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;
void exploreCave(int n)
{
int s[n], d[n];
memset(s, 1, sizeof(d));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (!s[j]) continue;
s[j] = 0;
int query = tryCombination(s);
if (query == -1 || query > i)
{
d[i] = j;
break;
}
s[j] = 1;
}
}
return answer(s, d);
}| # | 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... | ||||
