#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
vector<int> graph[maxn], L;
int timer = 0;
void dfs(int u, int p, int d) {
if(!d) L[u] = timer++;
for(int &v : graph[u]) if(v != p) dfs(v, u, d ^ 1);
if(d) L[u] = timer++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i=0; i<n; i++) graph[i].clear(), timer = 0;
for(int i=0; i<n-1; i++) {
graph[u[i]].push_back(v[i]);
graph[v[i]].push_back(u[i]);
}
L.clear();
L.resize(n);
dfs(0, 0, 0);
return L;
}
int find_next_station(int s, int t, vector<int> c) {
if(c[0] < s) {
if(s < t || t < c[0]) return c[0];
return c[upper_bound(c.begin(), c.end(), t)-c.begin()-1];
}
if(c.back() < t || t < s) return c.back();
return c[lower_bound(c.begin(), c.end(), s)-c.begin()];
}
