| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 882333 | dubabuba | Cave (IOI13_cave) | C++14 | 1 ms | 600 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>
const int mxn = 5050;
using namespace std;
void exploreCave(int N) {
int d[N], id[N];
for(int i = 0; i < N; i++)
id[i] = i;
memset(d, 0, sizeof d);
auto rev = [&](int l, int r) {
for(int i = l; i <= r; l++)
d[i] = 1 - d[i];
};
int las = tryCombination(d);
if(las == -1) answer(d, id);
while(1) {
d[las + 1] = 1 - d[las + 1];
las = tryCombination(d);
if(las == -1) answer(d, id);
}
answer(d, id);
}
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... | ||||
