| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1141020 | Aliyyiakbar | 동굴 (IOI13_cave) | C++20 | 7 ms | 328 KiB |
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;
mt19937_64 rng(chrono::steady_clock().now().time_since_epoch().count());
void exploreCave(int n)
{
int s[n], d[n];
memset(s, 0, sizeof(d));
for (int i = 0; i < n; ++i)
{
s[i] = 1;
int pos = tryCombination(s);
d[i] = pos;
s[i] = 0;
}
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... | ||||
