| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 672862 | 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 <vector>
#include <algorithm>
#include "IOI20_Stations.h"
//const int N = 1e5;
int cnt=0;
std::vector<int> labels;
/*
clarifications:
k == n-1
c is sorted
Debugging:
- Idea => Proof
- Code => Accepted
*/
std::vector<std::vector<int>> g;
void dfs(int node, int par) {
labels[node] = cnt++;
for (int ch : g[node]) {
if (ch != par) {
dfs(ch, node);
}
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
g.clear();
g.resize(n);
cnt = 1;
for (int i = 0; i < n - 1;i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
cnt = 0;
labels.clear();
labels.resize(n);
dfs(0, -1);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
//std::sort(c.begin(), c.end());
std::vector<int> gg = c;
sort(gg.begin(), gg.end());
if (gg != c) while(1){}
int sz = c.size();
if (s > t) 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];
}