# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481636 | SlavicG | 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 ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
void exploreCave(int n){
vector<int> a(n, 0);
int x = tryCombination(a);
while(x != -1){
a[x + 1] ^= 1;
x = tryCombination(a);
}
vector<int> v(n);
iota(all(v), 0);
answer(v, a);
}