#include "stations.h" #include <bits/stdc++.h> #include <vector> #define PB push_back using namespace std; vector<int>ady[1001]; int lab[1001]; int cur = 0; int dfs(int node, int parent){ for(auto i:ady[node]){ if(i==parent)continue; dfs(i, node); } lab[node]=cur++; return 1; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { vector<int>ab; for(int i = 0 ; i < n-1 ; i++){ ady[u[i]].PB(v[i]); ady[v[i]].PB(u[i]); } dfs(0, -1); for(int i = 0 ; i <= n-1 ; i++){ ab.PB(lab[i]); //cout<<lab[i]<<" "; } return ab; } int find_next_station(int s, int t, std::vector<int> c) { vector<int>::iterator ll = lower_bound(c.begin(), c.end(), t); if(ll!=c.end())return c[(ll-c.begin())]; else return c[c.size()-1]; }