#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int tt, in[N], out[N], lvl[N];
vector<int> adj[N], l;
void dfs(int u, int p, int d){
in[u] = tt++;
lvl[u] = d;
for(auto v : adj[u]) if(v != p) dfs(v, u, d + 1);
out[u] = tt++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
tt = 0;
for(int i = 0;i<n;i++) adj[i].clear(), in[i] = out[i] = 0;
for(int i = 0;i<n - 1;i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
l.resize(n);
dfs(0, -1, 0);
vector<pair<int, int>> use;
for(int i = 0;i<n;i++){
if(lvl[i] % 2 == 0){
use.push_back({in[i], i});
}else{
use.push_back({out[i], i});
}
}
sort(use.begin(), use.end());
for(int i = 0;i<n;i++){
l[use[i].second] = i;
}
return l;
}
int find_next_station(int s, int e, std::vector<int> c) {
if(s < c[0]){
int pv = s;
for(int i = 0;i<c.size() - 1;i++){
if(pv <= e && e <= c[i]) return c[i];
pv = c[i];
}
return c.back();
}else{
int pv = s;
for(int i = c.size() - 1;i>0;i--){
if(c[i] <= e && e <= pv) return c[i];
pv = c[i];
}
return c[0];
}
return 0;
}
