#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e3+42;
vector<int> adj[nmax];
int in[nmax],out[nmax],when;
vector<int> outp;
void dfs(int node,int par,int depth)
{
when++;
in[node]=when;
for(auto w:adj[node])
if(w!=par)dfs(w,node,depth+1);
when++;
out[node]=when;
//cout<<node<<" "<<depth<<" -> "<<in[node]<<" "<<out[node]<<endl;
if(depth%2==0)outp[node]=in[node];
else outp[node]=out[node];
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
outp={};
for(int i=0;i<n;i++)adj[i]={},outp.push_back(0);
when=0;
for(int i=0;i<n-1;i++)
{
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0,0,0);
//for(auto w:outp)cout<<w<<" ";cout<<endl;
return outp;
}
int find_next_station(int s, int t, std::vector<int> c) {
for(auto w:c)
if(w==t)return w;
sort(c.begin(),c.end());
if(c.size()==1)return c[0];
//cout<<"s= "<<s<<" t= "<<t<<" c= ";for(auto w:c)cout<<w<<" ";cout<<endl;
if(s<c[0])
{
vector<int> c_in={s+1};
vector<int> c_out=c;
c_out.pop_back();
for(int i=1;i<c_out.size();i++)
c_in.push_back(c_out[i-1]+1);
for(int i=0;i<c_in.size();i++)
if(c_in[i]<=t&&t<=c_out[i])return c[i];
return c.back();
}
vector<int> c_in=c;
vector<int> c_out={};
c_in.erase(c_in.begin(),c_in.begin()+1);
for(int i=0;i+1<c_in.size();i++)
c_out.push_back(c_in[i+1]-1);
c_out.push_back(s-1);
/*
cout<<"c_in: ";for(auto w:c_in)cout<<w<<" ";cout<<endl;
cout<<"c_out: ";for(auto w:c_out)cout<<w<<" ";cout<<endl;
*/
for(int i=0;i<c_in.size();i++)
if(c_in[i]<=t&&t<=c_out[i])return c[i+1];
return c[0];
}
/*
static int max_label = 0;
static int r, n, k, q;
static std::vector<int> u, v, labels, answers;
static std::map<int, int> reverse_labels;
static std::vector<std::vector<int>> adjlist;
static int s, t, w;
static std::vector<int> c;
int main() {
assert(scanf("%d", &r) == 1);
for (int tc = 0; tc < r; tc++) {
assert(scanf("%d%d", &n, &k) == 2);
u.resize(n - 1);
v.resize(n - 1);
adjlist.clear();
adjlist.resize(n);
for (int i = 0; i < n - 1; i++) {
assert(scanf("%d%d", &u[i], &v[i]) == 2);
adjlist[u[i]].push_back(v[i]);
adjlist[v[i]].push_back(u[i]);
}
labels = label(n, k, u, v);
if ((int)labels.size() != n) {
printf("Number of labels not equal to %d\n", n);
exit(0);
}
reverse_labels.clear();
for (int i = 0; i < n; i++) {
if (labels[i] < 0 || labels[i] > k) {
printf("Label not in range 0 to %d\n", k);
exit(0);
}
if (reverse_labels.find(labels[i]) != reverse_labels.end()) {
printf("Labels not unique\n");
exit(0);
}
reverse_labels[labels[i]] = i;
if (labels[i] > max_label) {
max_label = labels[i];
}
}
assert(scanf("%d", &q) == 1);
for (int i = 0; i < q; i++) {
assert(scanf("%d%d%d", &s, &t, &w) == 3);
c.clear();
for (int v : adjlist[s]) {
c.push_back(labels[v]);
}
std::sort(c.begin(), c.end());
int answer = find_next_station(labels[s], labels[t], c);
if (!std::binary_search(c.begin(), c.end(), answer)) {
printf("Label %d returned by find_next_station not found in c\n", answer);
exit(0);
}
answers.push_back(reverse_labels[answer]);
}
}
printf("%d\n", max_label);
for (int index : answers) {
printf("%d\n", index);
}
exit(0);
}
*/
