#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> labels(n);
vector<vector<int>> adj(n);
for (int i = 0; i < n - 1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int oneNeighbor = 0;
int counter = 0;
for (int i = 0; i < n; i++) {
if (adj[i].size() == 1) {
oneNeighbor = i;
break;
}
}
stack<int> dfs;
dfs.push(oneNeighbor);
vector visited(n, false);
while (!dfs.empty()) {
const int x = dfs.top();
dfs.pop();
if (visited[x]) continue;
visited[x] = true;
labels[x] = counter;
counter++;
for (int y : adj[x]) {
if (!visited[y]) dfs.push(y);
}
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (s < t) return s + 1;
else return s - 1;
}
