#include <bits/stdc++.h>
#include<speedrun.h>
using namespace std;
const int NMAX = 1e3;
const int BITS = 20, HALF = 10;
const int ROOT = 1, NONE = 0;
int par[1 + NMAX];
vector<int> tree[1 + NMAX];
int lastNode; int nextPreoder[1 + NMAX];
void DFSassign (int root, int p) {
par[root] = p;
nextPreoder[lastNode] = root; lastNode = root;
for (int node : tree[root])
if (node != p)
DFSassign (node, root);
}
void assignHints (int substask, int N, int A[], int B[]) {
setHintLen (BITS);
for (int i = 1; i < N; i ++) {
tree[A[i]].push_back (B[i]);
tree[B[i]].push_back (A[i]);
}
DFSassign (ROOT, NONE);
for (int node = 1; node <= N; node ++)
for (int bit = 0; bit < HALF; bit ++)
if (par[node] & (1 << bit))
setHint (node, bit + 1, true);
for (int node = 1; node <= N; node ++)
for (int bit = HALF; bit < BITS; bit ++)
if (nextPreoder[node] & (1 << (bit - HALF)))
setHint (node, bit + 1, true);
}
int getPar () {
int p = 0;
for (int bit = 0; bit < HALF; bit ++)
if (getHint (bit + 1) == true)
p = p + (1 << bit);
return p;
}
int getNextPreoder () {
int preord = 0;
for (int bit = HALF; bit < BITS; bit ++)
if (getHint (bit + 1) == true)
preord = preord + (1 << (bit - HALF));
return preord;
}
void speedrun (int subtask, int N, int start) {
getLength ();
while (getPar () > 0)
goTo (getPar ());
while (getNextPreoder () != NONE) {
int target = getNextPreoder ();
while (!goTo (target))
goTo (getPar ());
}
}
