#include <iostream>
#include "stations.h"
#include <vector>
#define ll long long
using namespace std;
const int N = 1002;
vector<int> g[N];
vector<int> labels;
int cnt = 0;
void dfs(int v) {
for (int to : g[v]) {
if (labels[to]) continue;
labels[to] = ++cnt;
dfs(to);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.clear();
labels.resize(n);
cnt = 0;
for (int i = 0; i < n; i++) {
g[i].clear();
}
for (int i = 0; i < n - 1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; i++) {
if (g[i].size() == 1) {
labels[i] = ++cnt;
dfs(i);
}
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (c.size() == 1)
return c[0];
if (t > s)
return c[1];
else
return c[0];
}
/*
1
5 1000
4 2
3 1
0 2
0 3
5
4 0 2
2 4 4
3 4 0
0 1 3
0 3 3
*/
