| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 670632 | pzorro | Cave (IOI13_cave) | C++14 | 9 ms | 400 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 <iostream>
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
const int MAXN = 5 * 1e3;
int s[MAXN];
int d[MAXN];
void exploreCave(int n){
for(int i = 0; i < n; i++){
s[i] = 0;
d[i] = i;
}
int res;
do{
res = tryCombination(s);
if(res != -1){
s[res]+=1;
}
}while(res != -1);
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... | ||||
