#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
int val;
const int N = 1005;
vector <int> labels;
vector <vector <int> > paths(N);
void traversal(int pos, int par) {
for (auto el : paths[pos]) {
if (el == par) continue;
traversal(el, pos);
}
labels[pos] = val++;
}
vector <int> label(int n, int k, vector <int> u, vector <int> v) {
val = 0;
labels.resize(n);
for (int i = 0; i < n; i++) paths[i].clear();
for (int i = 0; i < n - 1; i++) {
int a = u[i], b = v[i];
paths[a].push_back(b);
paths[b].push_back(a);
}
traversal(0, 0);
// for (int i = 0; i < n; i++) cout << i << ": " << labels[i] << '\n';
return labels;
}
int find_next_station(int st, int finish, vector <int> adjacent) {
int ans = -1, cmp = finish;
// cout << "here: " << st << ' ' << finish << '\n';
if (st < finish) cmp = st;
for (auto el : adjacent)
if (el >= cmp) {
ans = el;
break;
}
// cout << "return : " << ans << '\n';
return ans;
}
