#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> sz;
vector<int> eul;
vector<vector<int>> g;
int br;
void dfs(int c, int p){
eul[c]=br;
br++;
sz[c]=1;
for(auto a:g[c]){
if(a==p)continue;
dfs(a,c);
sz[c]+=sz[a];
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
sz.assign(n,0);
eul.assign(n,0);
g.resize(n);
for(int i=0;i<n;i++)g[i].clear();
for(int i=0;i<n-1;i++){
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
br=0;
dfs(0,-1);
for (int i = 0; i < n; i++) {
labels[i] = eul[i]*1000+sz[i]-1;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
for(auto a:c){
if(a/1000<s/1000)continue;
//cout<<t/1000<<' '<<a/1000<<' '<<a/1000+a%1000<<endl;
if(t/1000>=a/1000 && t/1000<=a/1000+a%1000)return a;
}
for(auto a:c){
if(a/1000<s/1000)return a;
}
return 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |