# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
614022 | Dan4Life | Stations (IOI20_stations) | C++17 | 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[1001], col;
int lab = 0;
void dfs(int s, int p=-1, int lab){
col[s]=lab; int x = 1000;
for(auto u : adj[s]){
if(u==p) continue;
if(lab==0) dfs(u,s,x);
else dfs(u,s,lab+1);
x+=1000;
}
}
vector<int> label(int n, int k, vector<int> a, vector<int> b)
{
col.resize(n,0); lab = 0;
for(int i = 0; i < n; i++) adj[i].clear();
for (int i = 0; i < n-1; i++)
adj[a[i]].pb(b[i]), adj[b[i]].pb(a[i]);
int ind = 0;
for(int i = 0; i < n; i++) if(adj[i].size()>=3) ind = i;
dfs(ind,-1,0); return col;
}
int fi(int x){
while(x>9) x/=10; return x;
}
int find_next_station(int s, int t, vector<int> c){
if(c.size()==1 or fi(s)!=fi(t)) return c[0];
if(c.size()==2) return c[1];
for(auto u : c)
if(fir(u)==fir(s))
return u;
}