# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499484 | andrei_boaca | Speedrun (RMI21_speedrun) | 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 "speedrun.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
typedef pair<int,int> pii;
vector<int> muchii[1005];
vector<int> st;
int n,par[1005];
bool use[1005];
void dfs(int nod)
{
st.push_back(nod);
use[nod]=1;
for(auto i:muchii[nod])
if(!use[i])
{
par[i]=nod;
dfs(i);
}
}
void assignHints(int subtask, int N, int A[], int B[]) {
n=N;
for(int i=1;i<n;i++)
{
muchii[A[i]].push_back(B[i]);
muchii[B[i]].push_back(A[i]);
}
dfs(1);
setHintLen(20);
for(int i=0;i<st.size();i++)
{
int p=par[st[i]];
int nod=st[i];
int lg=0;
for(int bit=9;bit>=0;bit--)
{
lg++;
if((p>>bit)&1)
setHint(nod,lg,1);
else
setHint(nod,lg,0);
}
int nxt=0;
if(i+1<st.size())
nxt=st[i+1];
for(int bit=9;bit>=0;bit--)
{
lg++;
if((nxt>>bit)&1)
setHint(nod,lg,1);
else
setHint(nod,lg,0);
}
}
}
pii getvals()
{
int nxt=0,p=0;
for(int i=1;i<=10;i++)
p=p*2+getHint(i);
for(int i=11;i<=20;i++)
nxt=nxt*2+getHint(i);
return {nxt,p};
}
int nrused=0;
void DFS(int nod)
{
if(use[nod]==0)
{
use[nod]=1;
nrused++;
}
if(nrused==n)
return;
pii x=getvals();
int nxt,p;
tie(nxt,p)=x;
if(nxt==0)
{
goTo(p);
DFS(p);
}
else if(!use[nxt])
{
while(!goTo(nxt))
{
goTo(p);
pii x=getvals();
if(use[p]==0)
{
use[p]=1;
nrused++;
}
if(nrused==n)
return;
p=x.second;
}
DFS(nxt);
}
else
{
goTo(p);
DFS(p);
}
}
void speedrun(int subtask, int N, int start) {
n=N;
for(int i=1;i<=n;i++)
use[i]=0;
DFS(start);
}