#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<int> labels;
vector<bool> vis;
int cnt = 0;
void dfs(int v) {
vis[v] = true;
labels[v] = cnt++;
for (int u : adj[v]) {
if (!vis[u]) {
dfs(u);
}
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
adj.assign(n, {});
labels.resize(n);
vis.assign(n, false);
cnt = 0;
for (int i = 0; i < u.size(); i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
auto upper = upper_bound(c.begin(), c.end(), t);
if (upper != c.begin()) {
upper--;
}
return *upper;
}
