| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 874319 | asli_bg | Cave (IOI13_cave) | C++11 | 1 ms | 480 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"
const int MAXN=5e3+3;
int S[MAXN];
int D[MAXN];
void exploreCave(int N) {
/* ... */
for(int i=0;i<N;i++){
S[i]=0;
D[i]=i;
}
int cev=tryCombination(S);
while(cev!=-1){
S[cev-1]=1;
cev=tryCombination(S);
}
answer(S,D);
}| # | 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... | ||||
