# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670591 | mseebacher | 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 <bits/stdc++.h>
#include "cave.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5
void exploreCave(int n){
int b[n];
for(int i = 0;i<n;i++){
b[i] = i;
}
int s[n];
for(int i = 0;i<n;i++) s[i] = 0;
int val = tryCombination(s);
while(val != -1){
s[i] = 1-s[i];
val = tryCombination(s);
}
answer(s,b);
}