#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g;
int cnt;
vector<int> in, out, d;
void dfs(int no, int rt, int dis) {
in[no] = cnt;
d[no] = dis;
cnt++;
for(auto i: g[no]) {
if(i == rt) continue;
dfs(i, no, dis+1);
}
out[no] = cnt;
cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
g.assign(n+2, vector<int>());
in.assign(n+2, 0);
out.assign(n+2, 0);
d.assign(n+2, 0);
for(int i=0; i<n-1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(0, -1, 0);
vector<pair<int, int>> lb;
for(int i=0; i<n; i++) {
if(d[i]%2 == 0) lb.push_back({in[i], i});
else lb.push_back({out[i], i});
}
sort(lb.begin(), lb.end());
for(int i=0; i<n; i++) {
labels[lb[i].second] = i;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
int sz = c.size();
if(s < c[0]) {
int rt = c[sz-1];
if(t < s || t >= rt) return rt;
for(int i=1; i<sz; i++) {
if(c[i] > t) return c[i-1];
}
return c[sz-1];
} else {
int rt = c[0];
if(t <= rt || t > s) return rt;
for(int i=1; i<sz; i++) {
if(c[i] > t) return c[i-1];
}
return c[sz-1];
}
}
