#include "stations.h"
#include <vector>
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<std::vector<int>> adj(n);
for (int i = 0; i < n - 1; i++) {
adj[v[i]].push_back(u[i]);
adj[u[i]].push_back(v[i]);
}
std::vector<int> id(n);
auto dfs = [&](auto self, int v, int f) -> void {
for (int u : adj[v]) {
if (u != f) {
self(self, u, v);
}
}
};
for (int i = 0; i < n; i++) {
if (adj[i].size() == 1) {
dfs(dfs, i, i);
break;
}
}
return id;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (s < t) {
return *std::max_element(c.begin(), c.end());
} else {
return *std::min_element(c.begin(), c.end());
}
}
