# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272528 | shinjan | 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 <iostream>
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n)
{
int s[n];
int d[n];
for(int i=0;i<n;i++)
{
s[i]=0;
d[i]=-1;
}
tren=tryCombination(s);
int x;
while(tren!=-1)
{
for(int i=0;i<n;i++)
{
if(d[i]<0)
{
s[i]=(!s[i]);
x=tryCombination(s);
if(x==-1)
{
d[i]=x;
tren=x;
break;
}
if(x<tren)
{
d[i]=x;
s[i]=(!s[i]);
}
else if(x>tren)
{
d[i]=tren;
tren=x;
}
}
}
}
for(int i=0;i<n;i++)
{
if(d[i]<0)
{
s[i]=(!s[i]);
d[i]=tryCombination(s);
s[i]=(!s[i]);
}
}
answer(s,d);
}