# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
860328 | ASN49K | Speedrun (RMI21_speedrun) | 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.
void assignHints (int subtask , int n, int a[], int b[])
{
vector<vector<int>>g(n+1);
setHintLen(20);
for(int i=1;i<n;i++)
{
g[a[i]].pb(b[i]);
g[b[i]].pb(a[i]);
}
vector<int>nodes;
function<void(int,int)>dfs=[&](int x,int tt)
{
for(int i=0;i<10;i++)
{
setHint(x,i,tt&(1<<i)>0);
}
nodes.pb(x);
};
dfs(1,0);
nodes.pb(0);
for(int i=1;i<=n;i++)
{
for(int j=0;j<10;j++)
{
setHint(nodes[i-1],j+10,nodes[i]&(1<<j)>0);
}
}
}
void speedrun(int subtask , int n, int x )
{
auto tata=[&]()
{
int sol=0;
for(int i=0;i<10;i++)
{
if(getHint(i))
{
sol|=(1<<i);
}
}
return sol;
};
auto next=[&]()
{
int sol=0;
for(int i=0;i<10;i++)
{
if(getHint(i+10))
{
sol|=(1<<i);
}
}
return sol;
};
while(x!=1)
{
x=tata();
goTo(x);
}
for(int i=1;i<n;i++)
{
int urm=next();
while(!goTo(urm))
{
goTo(tata());
}
}
}