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;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
vector<vector<int>> adj(n);
for (int i = 0; i < n - 1; ++i) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for (int i = 0; i < n; ++i)
sort(adj[i].begin(), adj[i].end());
int dtime = -1;
auto dfs = [&](auto self, int u, int p) -> void {
labels[u] = ++dtime;
for (int v : adj[u]) if (v != p) {
self(self, v, u);
}
};
dfs(dfs, 0, -1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (t < s)
return *min_element(c.begin(), c.end());
int id = upper_bound(c.begin(), c.end(), t) - c.begin() - 1;
return c[id];
}
# | 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... |