# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
859130 | Vanio | 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<bits/stdc++.h>
#include "speedrun.h"
using namespace std;
int n,f[1001],pr;
vector<int> v[1001];
void encode(int p, int k, int indx){
int i=indx;
while(k>0){
setHint(p,i,k%2);
k/=2;
i++;
}
}
void dfsen(int k, int par){
pr=k;
if(v[k].size()==0){f[k]=2; return;}
else{
f[k]=1;
if(f[pr]==2){
encode(pr,k,1);
encode(pr,par,11);
}
encode(k,par,1);
encode(k,v[k][0],11);
for(int i=0;i<v[k].size();i++){
if(f[v[k][i]]==0) dfsen(v[k][i],k);
}
}
}
void assignHints(int subtask, int N, int a[], int b[]){
n=N;
int i;
for(i=1;i<n;i++){
v[a[i]].push_back(b[i]);
v[b[i]].push_back(a[i]);
}
setLength(20);
dfsen(1,0);
}
int decode(int indx){
int s=0,t=512,i;
for(i=indx;i>indx-10;i--){
s+=getHint(i)*t;
t/=2;
}
return s;
}
void dfssr(int k,int par){
if(par!=decode(10)){
v[decode(20)].push_back(decode(10));
return;
}
v[k].push_back(decode(20));
for(int i=0;i<v[k].size();i++){
goTo(v[k][i]);
dfssr(v[k][i],k);
}
}
void speedrun(int subtask, int N, int start){
n=N;
int i,t;
if(decode(20)==0){
for(i=1;i<=n;i++){
if(goTo(i)) break;
}
}
while(t=decode(10)) goTo(t);
dfssr(1,0);
}