# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142390 | vyaduct | Cave (IOI13_cave) | C++20 | 1 ms | 328 KiB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
// Max Call tryComb() 70'000
// int tryCombination(int S[])
// void answer(int S[], int D[]);
void exploreCave(int N) {
int S[N], D[N];
memset(S, 0, N * sizeof(int));
for (int i=0;i<N;i++){
D[i] = i;
S[i] = 0;
int ans = tryCombination(S);
if (ans == -1) S[i] = 1;
else S[i] = 0;
}
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... |