#include <bits/stdc++.h> #include "stations.h" #define y e[x][i] using namespace std; typedef vector<int> vec; int sum; vector<vec> e; vec res; void dfs(int x,int fa,bool d){ if(d) res[x]=sum++; for(int i=0;i<e[x].size();i++) if(y!=fa) dfs(y,x,d^1); if(!d) res[x]=sum++; } vec label(int n,int k,vec u,vec v){ res.resize(n);e.resize(n,vec()); for(int i=0;i<n-1;i++) {e[u[i]].push_back(v[i]);e[v[i]].push_back(u[i]);} sum=0;dfs(0,-1,1);return res; } int find_next_station(int s,int t,vec c){ if(c[0]>s){ if(t<s||c.back()<t) return c.back(); return *lower_bound(c.begin(),c.end(),t); } if(t<c[0]||s<t) return c[0]; return *(upper_bound(c.begin(),c.end(),t)-1); }

stations.cpp: In function 'void dfs(int, int, bool)':
stations.cpp:11:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(int i=0;i<e[x].size();i++)
      |              ~^~~~~~~~~~~~