# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744402 | Elvin_Fritl | 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>
using namespace std;
#include "cave.h"
void exploreCave(int n) {
vector<int>chek(n,0),v;
int d[n],s[n];
for(int i=0;i<n;i++){
s[i]=0;
}
int time=1;
while(time<=n){
int toto=tryCombination(s);
if(toto >= time){
for(int i=0;i<n;i++){
if(chek[i]==0){
s[i]=(s[i]+1)%2;
int toto2=tryCombination(s);
if(toto2 == toto-1){
v.push_back(i);
color[i]=1;
break;
}
s[i]=(s[i]+1)%2;
}
}
}
else{
for(int i=0;i<n;i++){
if(chek[i]==0){
s[i]=(s[i]+1)%2;
int toto2=tryCombination(s);
if(toto2 == toto){
v.push_back(i);
color[i]=1;
break;
}
s[i]=(s[i]+1)%2;
}
}
}
time++;
}
for(int i=0;i<n;i++){
d[i]=v[i];
}
answer(s,d);
}