| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 590000 | shezitt | Cave (IOI13_cave) | C++14 | 25 ms | 468 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 <iostream>
#include <algorithm>
#include <cstring>
void exploreCave(int N) {
int a[N];
for(int i=0; i<N; ++i){
a[i] = 0;
}
int p = tryCombination(a);
while(p != -1){
a[p] = !a[p];
p = tryCombination(a);
}
int b[N];
for(int i=0; i<N; ++i){
a[i] = !a[i];
b[i] = tryCombination(a);
a[i] = !a[i];
}
answer(a, b);
}
| # | 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... | ||||
