# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
1240539 | | Jer | 동굴 (IOI13_cave) | C++20 | | 6 ms | 328 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n)
{
int s[n], d[n];
for (int i = 0; i < n; i++)
d[i] = i, s[i] = 0;
int curr = 0;
while (true)
{
curr = tryCombination(s);
if (curr == -1)
break;
s[curr] = 1;
}
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... |