# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650770 | Litusiano | Cave (IOI13_cave) | C++14 | 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;
void exploreCave(int N) {
/* ... */
int v[N];
for(int i = 0; i<N; i++){
cin>>v[i];
}
int idx = tryCombination(v);
while(idx != -1;){
v[idx] ^= 1;
idx = tryCombination(v);
}
int s[N]; for(int i = 0; i<N; i++) s[i] = i;
answer(s,v);
}