#include <station.h>
#include <bits/stdc++.h>
using namespace std;
int coun=0;
vector < vector <int> > vec(1000);
vector <int> L(1000);
void dfs (int x, int y, int h)
{
if (h%2==0) L[x]=coun;
coun++;
for (int i=0; i<vec[x].size(); i++)
{
if (vec[x][i]==y) continue;
dfs(vec[x][i], x, h+1);
}
if (h%2==1) L[x]=coun;
h--; coun++;
}
vector <int> label(int n, int k, vector <int> u, vector <int> v)
{
int s, h, i;
for (i=0; i<n; i++)
{
vec[u[i]].push_back(v[i]);
vec[v[i]].push_back(u[i]);
}
L[0]=0;
dfs (0, 0, 0);
return L;
}
int find_next_station(int s, int t, vector <int>c)
{
int n=c.size(), i;
int in[n+1], out[n+1];
if (s>c[n-1])
{
in[n]=c[1]-1;
out[n]=s;
for (i=0; i<n; i++)
in[i]=c[i];
for (i=1; i<n; i++)
{
out[i]=in[i+1]-1;
}
if (t>in[n] && t<out[n])
{
for (i=1; i<n; i++)
{
if (t>=in[i] && t<=out[i]) return c[i];
}
}
else return c[0];
}
else
{
in[n]=s;
out[n]=c[n-2]+1;
for (i=0; i<n; i++)
out[i]=c[i];
in[0]=s+1;
for (i=1; i<n; i++)
{
in[i]=out[i-1]+1;
}
if (t>in[n] && t<out[n])
{
for (i=0; i<n-1; i++)
{
if (t>=in[i] && t<=out[i]) return c[i];
}
}
else return c[n-1];
}
}
Compilation message
stations.cpp:1:10: fatal error: station.h: No such file or directory
1 | #include <station.h>
| ^~~~~~~~~~~
compilation terminated.
