#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
const int TAILLEMAXI=1002;
vector<int> adja[TAILLEMAXI];
int num[TAILLEMAXI];
int ec;
void dfs(int a,int vient){
num[a]=ec;
ec++;
for (int i:adja[a]){
if (i!=vient){
dfs(i,a);
}
}
}
vector<int> label(int nbstations,int k,vector<int> u,vector<int> v) {
vector<int> rep;
rep.clear();
for (int i=0;i<nbstations-1;i++){
adja[u[i]].push_back(v[i]);
adja[v[i]].push_back(u[i]);
}
dfs(0,TAILLEMAXI-1);
for (int i=0;i<nbstations;i++){
rep.push_back(i);
}
return rep;
for (int i=0;i<nbstations;i++){
rep.push_back(num[i]);
//cerr<<num[i]<<" ";
}
//cout<<endl;
return rep;
}
int find_next_station(int s,int t,vector<int> voisins) {
if (t<=s){
//cout<<voisins[0]<<endl;
return voisins[0];
}
int a=0;
while (a<(int)voisins.size() and t>=voisins[a]){
//cout<<a<<endl;
a++;
}
a--;
return voisins[a];
}
