# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954446 | __Davit__ | Cave (IOI13_cave) | C++17 | 2 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int *subtask2(int a[]) {
return a;
int n = sizeof(a) / sizeof(int);
int res[n];
for (int i = 0; i < n; i++) {
a[i] ^= 1;
int x = tryCombination(a);
a[i] ^= 1;
res[i] = x;
}
return res;
}
}
void exploreCave(int N) {
int a[N];
for (int i = 0; i < N; i++)a[i] = 0;
int *b = subtask2(a);
// for (int i = 0; i < N; i++)b[i] = i;
// int x = tryCombination(a);
answer(a, b);
}
Compilation message (stderr)
# | 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... |