#include "stations.h" #include<bits/stdc++.h> using namespace std; #define mp make_pair #define INF 10000000 #define MOD 1000000007 #define MID ((l+r)/2) #define HASHMOD 2305843009213693951 #define ll long long #define ull unsigned long long #define F first #define S second typedef pair<ll, ll> ii; typedef pair<ii, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef map<int, int> mii; #define EPS 1e-6 #define FOR(i,n) for(int i=0;i<((int)(n));i++) #define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++) #define FOA(v, a) for(auto v : a) vi label(int n, int k, std::vector<int> u, std::vector<int> v) { vi labels(n); vector<vi> adj(n, vi()); for (int i = 0; i < n-1; i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } int f=0; FOR(i,n){ if(adj[i].size()==1) f = i; } vector<bool> vis(n, false); FOR(i,n){ vis[f] = true; labels[f] = i; FOA(v, adj[f]) if(!vis[v]) f = v; } //FOA(v, labels) cout<<v<<" "; //cout<<endl; return labels; } int find_next_station(int s, int t, std::vector<int> c) { if(c.size()==1) return c[0]; else{ if(s<t && c[0]<c[1]) return c[1]; else return c[0]; } }