#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int nx = 1005;
vector<int> labels;
vector<int> adj[nx];
int timer = 0;
void dfs(int u, int pa, int depth) {
if (depth % 2) {
for (auto v : adj[u]) {
if (v == pa) continue;
dfs(v, u, depth + 1);
}
labels[u] = timer++;
} else {
labels[u] = timer++;
for (auto v : adj[u]) {
if (v == pa) continue;
dfs(v, u, depth + 1);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.resize(n);
for (int i = 0; i < n; i++) adj[i].clear();
timer = 0;
for (int i = 0; i < n - 1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, -1, 0);
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (c.size() == 1) {
return c[0];
}
//cout << "c array : ";
//for (auto x : c) cout << x << " ";
//cout << endl;
if (s > c.back()) {
int tin = c[1];
int tout = s;
//cout << tin << " * " << tout << "\n";
if (!(tin <= t && t <= tout)) return c[0];
for (int i = c.size() - 1; i > 0; i--) {
if (t >= c[i]) return c[i];
}
}
int tin = s, tout = c[c.size() - 2];
//cout << tin << " : " << tout << "\n";
if (!(tin <= t && t <= tout)) return c.back();
for (int i = 0; i < c.size() - 1; i++) {
if (t <= c[i]) return c[i];
}
return 0;
}
