#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int curInd, ind[N];
vector <int> adj[N];
void dfs(int u, int p, int c){
if (!c)
ind[u] = curInd++;
for(int v : adj[u])
if (v != p)
dfs(v, u, c ^ 1);
if (c)
ind[u] = curInd++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i = 0; i < n; i++)
adj[i].clear();
for(int i = 0; i < n - 1; i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
curInd = 0;
dfs(0, -1, 0);
return vector <int> (ind, ind + n);
}
int find_next_station(int s, int t, vector<int> c) {
if ((int) c.size() == 1)
return c.front();
for(int v : c)
if (v == t)
return v;
if (s < c.front()){
int pre = s;
for(int i = 0; i < (int) c.size(); i++){
int nxt = c[i];
assert(pre < nxt);
if (pre < t && t <= nxt)
return nxt;
pre = nxt;
}
return c.back();
} else {
int pre = s;
for(int i = (int) c.size() - 1; i > 0; i--){
int nxt = c[i];
assert(nxt < pre);
if (nxt <= t && t < pre)
return nxt;
pre = nxt;
}
return c.front();
}
}
