| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 728647 | vjudge1 | Cave (IOI13_cave) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
#define N '\n';
#define VI <vector <int>>
#define VVI <vector <vector <int>>>
int exploreCave(int N){
vector <int> el (N, 0) ;
lastAns = -2;
int i = -1;
while(lastAns != -1){
if(i != -1){
el[i] = 1;
}
lastAns = tryCombination(el);
i = lastAns;
}
vector <int >d[i](N);
for(int i = 0; i < N; i++){
d[i] = i;
}
answer(el, d);
}
