#include "stations.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 1005;
vector<int> gph[MAXN];
int dep[MAXN];
int L[MAXN], piv;
void dfs(int x, int p = -1){
if(dep[x] % 2 == 0) L[x] = piv++;
for(auto &i : gph[x]){
if(i == p) continue;
dep[i] = dep[x] + 1;
dfs(i, x);
}
if(dep[x] % 2 == 1) L[x] = piv++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
piv = 0;
memset(L, 0, sizeof(L));
for(int i=0; i<MAXN; i++) gph[i].clear();
for(int i=0; i<n-1; i++){
gph[u[i]].push_back(v[i]);
gph[v[i]].push_back(u[i]);
}
dfs(0);
std::vector<int> labels(L, L + n);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(sz(c) == 1) return c[0];
if(s < c[0]){ // din
for(int i=0; i<sz(c)-1; i++){
if(s <= t && t <= c[i]) return c[i];
}
return c.back();
}
else{
for(int i=sz(c)-1; i>=1; i--){
if(c[i] <= t && t <= s) return c[i];
}
return c[0];
}
}
