#include "stations.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
vector<int> g[1000];
int tin[1000], tout[1000], tt = 0;
void dfs(int v, int p){
tin[v] = tt++;
for (int u : g[v]){
if (u == p) continue;
dfs(u, v);
}
tout[v] = tt - 1;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for (int i = 0; i < n; i++)
g[i].clear();
tt = 0;
for (int i = 0; i < sz(u); i++){
g[u[i]].PB(v[i]);
g[v[i]].PB(u[i]);
}
int root = 0;
while (sz(g[root]) > 1) root++;
dfs(0, -1);
vector<int> labels;
labels.resize(n);
for (int i = 0; i < n; i++) {
labels[i] = tin[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int dst = int(2e9), best = 0;
for (int v : c)
if (abs(v - t) < dst){
dst = abs(v - t);
best = v;
}
return best;
}
