#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
vector<vector<int>> g(n);
for(int i = 0;i < n - 1;i ++){
g[u[i]].emplace_back(v[i]);
g[v[i]].emplace_back(u[i]);
}
int timer = -1;
vector<int> in(n) , out(n);
function<void(int , int)> dfs = [&](int u , int p){
in[u] = ++timer;
for(int v : g[u]){
if(v != p){
dfs(v , u);
}
}
out[u] = timer;
};
dfs(0 , 0);
for(int i = 0;i < n;i ++){
labels[i] = in[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
c.emplace_back(1E9);
for(int i = 1;i < (int)c.size() - 1;i ++){
if(c[i] <= t && t < c[i + 1]){
return c[i];
}
}
return c[0];
}
# | 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... |