#include "stations.h" #include <vector> #define vec vector #define For(i, n) for(int i = 0; i < n; i++) using namespace std; void dfs(int x, vec<int>&odp, vec<vec<int>>&g, int &et, int pr = -1){ odp[x] = et; et++; for(auto &i : g[x]){ if(i == pr) continue; dfs(i, odp, g, et, x); } return; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { vec<int> odp(n); vec<vec<int>> g(n); For(i, u.size()){ g[u[i]].push_back(v[i]); g[v[i]].push_back(u[i]); } int et = 0; For(i, g.size()){ if(g[i].size() == 1){ dfs(i, odp, g, et); break; } } return odp; } int find_next_station(int s, int t, std::vector<int> c) { for(auto &i : c){ if(i < s && s > t) return i; if(i > s && s < t) return i; } return -1; }