# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308140 | daniel920712 | Cave (IOI13_cave) | C++14 | 433 ms | 1016 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 <set>
#include <vector>
#include <stdio.h>
using namespace std;
set < int > all;
vector < int > how;
int have[5005]={0};
int ans[5005];
void F(int l,int r,int here,int what)
{
int t,x,y,t2,i;
if(l==r)
{
have[how[l]]=0;
t=tryCombination(have);
if(t==here) have[how[l]]=1;
else have[how[l]]=0;
ans[how[l]]=here;
all.erase(how[l]);
return;
}
x=(l+r)/2;
for(i=l;i<=x;i++) have[how[i]]=1-have[how[i]];
t=tryCombination(have);
/*printf("aa %d\n",here);
for(i=l;i<=r;i++) printf("%d ",how[i]);
printf("\n");
printf("%d %d\n",what,t);*/
if((t==here)!=(what==here)) F(l,x,here,t);
else F(x+1,r,here,t);
}
void exploreCave(int N)
{
int i;
for(i=0;i<N;i++) all.insert(i);
for(i=0;i<N;i++)
{
how.clear();
for(auto j:all)
{
how.push_back(j);
have[j]=0;
}
F(0,N-i-1,i,tryCombination(have));
}
answer(have,ans);
}
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... |