#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<int>>g;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
g.assign(n,vector<int>());
vector<bool>cnt(n,0);
for (int i = 0; i < n-1; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
if(g[u[i]].size()==2)
cnt[u[i]]=1;
if(g[v[i]].size()==2)
cnt[v[i]]=1;
}
vector<int>labels(n);
for(int i=0;i<n;i++)
if(!cnt[i])
{
ll start=i,pre=i;
ll idx=0;
while(true)
{
labels[start]=idx++;
bool tf=0;
for(auto x:g[start])
if(x!=pre)
{
tf=1;
swap(start,pre);
start=x;
break;
}
if(!tf)
break;
}
break;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c)
{
ll l=-1,r=INF;
if(c.size()==1)
{
if(c[0]<s)
l=c[0];
else
r=c[0];
}
else
{
l=min(c[0],c[1]);
r=max(c[0],c[1]);
}
if(t>s)
return r;
else
return l;
}
