#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;
void assignHints(int id,int n, int a[], int b[]) {
if (id==1) {
setHintLen(n);
for(int i=1;i<=n-1;++i) {
int u=a[i],v=b[i];
setHint(u,v,1);
setHint(v,u,1);
}
}
if (id==2) {
setHintLen(20);
vector<int>deg(n+1,0);
for(int i=0;i<n-1;++i) deg[a[i]]++;
for(int i=0;i<n-1;++i) deg[b[i]]++;
int mx=0;
for(int i=1;i<=n;++i) if (deg[i]>deg[mx]) mx=i;
for (int i=1; i<=n; ++i) {
if (i==mx) setHint(i,20,1);
for (int j=11; j>0; --j) {
setHint(i,j,!!(mx&(1<<(j-1))));
}
}
}
if (id==3) {
setHintLen(20);
vector<pair<int,int>> adj(n+1,{0,0});
for (int i=1; i<n; ++i) {
if (adj[a[i]].first) adj[a[i]].second=b[i];
else adj[a[i]].first=b[i];
if (adj[b[i]].first) adj[b[i]].second=a[i];
else adj[b[i]].first=a[i];
}
for (int i=1; i<=n; ++i) {
for (int j=10; j; --j) {
setHint(i,j,!!(adj[i].first&(1<<(j-1))));
}
for (int j=10; j; --j) {
setHint(i,j+10,!!(adj[i].second&(1<<(j-1))));
}
}
}
}
int n;
vector<vector<int>> adj(1e3+1,vector<int>(1e3+1,0));
void dfs(int u, int p) {
for (int j=1; j<=n; ++j) {
adj[u][j]=getHint(j);
}
for (int i=1; i<=n; ++i) {
if (i==p) continue;
if (adj[u][i]) {
goTo(i);
dfs(i,u);
}
}
if (p==-1) return;
goTo(p);
}
void dfs2(int u, int p) {
int l=0, r=0;
for (int j=10; j>0; --j) {
l+=getHint(j)<<(j-1);
r+=getHint(j+10)<<(j-1);
}
adj[u][l]=1, adj[u][r]=1;
for (int i=1; i<=n; ++i) {
if (i==p) continue;
if (adj[u][i]) {
goTo(i);
dfs(i,u);
}
}
if (p==-1) return;
goTo(p);
}
int center=0;
vector<int> vis(1e3+1,0);
void speedrun(int id,int N,int start) {
n=N;
if (id==1) {
dfs(start,-1);
}
if (id==2) {
for (int j=11; j>0; --j) {
center+=getHint(j)<<(j-1);
}
bool b=getHint(20);
if (!b) {
goTo(center);
}
for (int i=1; i<=n; ++i) {
if (i==center) continue;
goTo(i);
goTo(center);
}
}
if (id==3) {
dfs2(start,-1);
}
}
