# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667259 | irmuun | 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;
#define ll long long
void exploreCave(int n){
vector<int>s(n,0);
vector<int>d(n);
iota(d.begin(),d.end(),0);
int x=tryCombination(s);
while(x>-1){
s[x]=1-s[x];
x=tryCombination(s);
}
answer(s,d);
}