# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672852 | vjudge1 | 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 <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int labels[N], cnt;
int* label(int n, int k, int* u, int* v);
int find_next_station(int s, int t, int* c);
/*
clarifications:
k == n-1
c is sorted
*/
vector<vector<int>> g;
void dfs(int node, int par) {
labels[node] = cnt++;
for (int ch : g[node]) {
if (ch != par) {
dfs(ch, node);
}
}
}
int* label(int n, int k, int* u, int* v) {
g.clear();
g.resize(n);
for (int i = 0; i < n - 1;i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
cnt = 0;
dfs(0, -1);
return labels;
}
int find_next_station(int s, int t, int* c) {
int sz = sizeof c;
if (t <= c[0]) return c[0];
for (int i = 1; i < sz-1; i++) {
if (t >= c[i] && t < c[i + 1]) return c[i];
}
return c[sz - 1];
}