# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674149 | Essa2006 | 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>Vis, new_;
vector<vector<int>>A;
int time;
void dfs(int ind){
Vis[ind]=1, new_[ind]=time_++;
for(int i=0;i<A[ind].size();i++)
if(!Vis[A[ind][i]])
dfs(A[ind][i]);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
Vis.clear(), A.clear(), new_.clear();
Vis.resize(n), A.resize(n), new_.resize(n);
time_=0;
for(int i=0;i<n-1;i++)
A[u[i]].push_back(v[i]), A[v[i]].push_back(u[i]);
for(int i=0;i<n;i++){
if(A[i].size()==1){
dfs(i);
break;
}
}
return new_;
}
int find_next_station(int s, int t, vector<int> c) {
if(!s)
return c[0];
return c[(t>s)];
}