# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208999 | robs | 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;
const int maxn = 1e4;
int s[maxn],d[maxn];
void exploreCave(int N){
while(true)
{
int n = tryCombination(s[]);
if(n == -1) break;
s[n-1] ^= 1;
}
for(int i = 0; i < N; i++) d[i] = i;
answer(s[], d[]);
}