# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361934 | valerikk | 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 <functional>
#include <vector>
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<std::vector<int>> e(n);
for (int i = 0; i < n - 1; i++) {
e[u[i]].push_back(v[i]);
e[v[i]].push_back(u[i]);
}
std::vector<int> in(n), out(n);
int t = 0;
function<void(int, int)> dfs = [&](int u, int p) {
in[u] = t++;
for (int v: e[u]) {
if (v != p) {
dfs(v, u);
}
}
out[u] = min(n - 1, t);
}(0, -1);
std::vector<int> res(n);
for (int i = 0; i < n; i++) res[i] = in[i] * 1000 + out[i];
}
int find_next_station(int s, int t, std::vector<int> c) {
int in_s = s / 1000, out_s = s % 1000;
if (in_s == 0) out_s++;
int in_t = t / 1000, out_t = t % 1000;
std;:vector<int> in_c, out_c;
for (int u: c) {
in_c.push_back(u / 1000);
out_c.push_back(u % 1000);
}
int p = -1;
for (size_t i = 0; i < c.size(); i++) {
if (in_c[i] <= in_s && out_c[i] >= out_s) {
p = c[i];
} else {
if (in_c[i] <= in_t && out_c[i] >= out_t) {
return c[i];
}
}
}
return p;
}