| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 68755 | someone_aa | Cave (IOI13_cave) | C++17 | 36 ms | 640 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;
void exploreCave(int N) {
int open_comb[N];
int sw[N];
for(int i=0;i<N;i++) sw[i] = i;
int curr[N];
memset(curr,0,sizeof(curr));
for(int i=0;i<N;i++) {
int ans = tryCombination(curr);
if(ans > i || ans == -1) open_comb[i] = 0;
else if(ans == i) open_comb[i] = 1;
curr[i] = open_comb[i];
}
answer(open_comb, sw);
}| # | 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... | ||||
