# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517069 | Sirapetch | Stations (IOI20_stations) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector <int> path[1111];
queue <int> walk;
int pass[1111],label[1111];
vector <int> label(int n, int k, vector<int> u, vector<int> v)
{
int i,x;
for(i=0;i<n;i++)
{
pass[i]=0;
}
for(i=0;i<u.size();i++)
{
path[u[i]].push_back(v[i]);
path[v[i]].push_back(u[i]);
walk.push(0);
x=0;
}
while(!walk.empty())
{
i=walk.front();
if(pass[i]==1) continue;
pass[i]=1;
label[i]=x;
x++;
for(auto a:path[i])
{
walk.push(a);
}
}
return label;
}
int find_next_station(int s, int t, vector<int> c)
{
if(s<t) return s+1;
else return s-1;
}