#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[1005], tmp;
void dfs(int u, int p, int ct) {
tmp[u] = ct;
for(int n:adj[u]) {
if(n==p) continue;
dfs(n, u, ct+1);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for(int i=0;i<n;i++) labels[i] = i;
/*tmp.clear();
tmp.resize(n);
for(int i=0;i<n;i++) adj[i].clear();
for(int i=0;i<n-1;i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for(int i=0;i<n;i++) {
if(adj[i].size()==1) {
dfs(i, i, 0);
break;
}
}
for(int i=0;i<n;i++) labels[i] = tmp[i];*/
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
/*if(t>s) return s+1;
return s-1;*/
while((t-1)/2>s) {
t = (t-1)/2;
}
if(t==s) return t;
return (s-1)/2;
}
