#include "stations.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int MAXN = 1e3+10;
const int MAX = 1e3;
int n, k;
vector <int> adj[MAXN];
vector <int> lab;
int le[MAXN], ri[MAXN], day, dep[MAXN];
void dfs(int nw, int pa){
dep[nw] = dep[pa]+1;
if(dep[nw] % 2) le[nw] = ++day;
for(auto nx : adj[nw]){
if(nx==pa) continue;
dfs(nx, nw);
}
if(dep[nw] % 2 == 0) ri[nw] = ++day;
}
vector<int> label(int N, int K, vector<int> u, vector<int> v) {
n = N; k = K;
lab.clear();
day = 0;
for(int i=0; i<=n; i++){
adj[i].clear();
}
for(int i=0; i<u.size(); i++){
adj[u[i]+1].pb(v[i]+1); adj[v[i]+1].pb(u[i]+1);
}
dfs(1, 0);
for(int i=1; i<=n; i++){
if(dep[i] % 2) lab.pb(le[i]);
else lab.pb(ri[i]);
}
// for(auto in : lab) cout << in << " in\n";
return lab;
}
int find_next_station(int s, int t, vector<int> c) {
if(s < c[0]){ // start, en, en, en
// cout << " pp\n";
for(int i=0; i+1<c.size(); i++){
if(s <= t && t <= c[i]){
// cout << c[i] << " ans\n";
return c[i];
}
}
// cout << c.back() << " ans\n";
return c.back();
}
// sta, sta, sta, en -> nw
for(int i=(int)c.size()-1; i>=1; i--){
if(c[i] <= t && t<=s){
// cout << c[i] << " ans\n";
return c[i];
}
}
// cout << c[0] << " ans\n";
return c[0];
}
