# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650777 | Litusiano | 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 int long long
void exploreCave(int N) {
/* ... */
int v[N];
for(int i = 0; i<N; i++){
v[i] = 0;
}
int s[N];
for(int i = 0; i<N; i++) s[i] = i;
if(tryCombination(v) == -1){
For(int i = 0; i<N; i++){
v[i] = 1;
s[i] = tryCombination(v);
v[i] = 0;
}
}
else{
for(int i = 0; i<N; i++){
if(tryCombination(v) == i){
v[i]^=1;
}
}
}
answer(v,s);
//for(int i = 0; i<N; i++) cout<<v[i]<<" "; cout<<endl;
//for(int i = 0; i<N; i++) cout<<s[i]<<" "; cout<<endl;
return;
}