# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272728 | shinjan | 동굴 (IOI13_cave) | C++14 | 18 ms | 384 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;
int nadji(int tren,int s[],int d[],int n)
{
int x;
for(int i=0;i<n;i++)
{
if(d[i]<0)
{
s[i]=!s[i];
x=tryCombination(s);
if(x>tren)
{
d[i]=tren;
return x;
}
if(x<tren)
{
d[i]=x;
if(x==-1)
{
return -1;
}
s[i]=!s[i];
}
}
}
}
void exploreCave(int n)
{
int s[n];
int d[n];
for(int i=0;i<n;i++)
{
s[i]=0;
d[i]=-1;
}
int tren,prob,res;
tren=tryCombination(s);
int x;
while(tren!=-1)
{
prob=tren;
while(d[prob]>0)
{
prob=d[prob];
}
s[prob]=(!s[prob]);
res=tryCombination(s);
while(res<tren)
{
d[prob]=res;
if(res==-1)
{
tren=-1;
break;
}
s[prob]=(!s[prob]);
prob=res;
while(d[prob]>0)
{
prob=d[prob];
}
s[prob]=(!s[prob]);
res=tryCombination(s);
}
if(res>tren && tren!=-1)
{
d[prob]=tren;
tren=res;
}
else if(tren==res && tren!=-1)
{
tren=nadji(tren,s,d,n);
}
}
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);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |