| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 282836 | Shush | Cave (IOI13_cave) | C++17 | 14 ms | 384 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 <bits/stdc++.h>
#include "cave.h"
using namespace std;
int n, *s, *t;
void exploreCave(int N) {
n = N;
s = new int[n];
t = new int[n];
for(int i = 0; i < n; i++){
t[i] = i;
s[i] = 0;
}
for(int i = 0; i < n; i++){
int c = tryCombination(s);
if(c == -1) break;
s[c] = 1 - s[c];
}
answer(s, t);
}
| # | 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... | ||||
