# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578541 | Vanilla | Stations (IOI20_stations) | C++17 | 959 ms | 904 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>
#include "stations.h"
using namespace std;
const int maxn = 1002;
vector <int> ad [maxn];
int ct = 0;
int dfs (int u, int p, vector <int> &lb) {
lb[u] = ct++;
int mx = 0;
for (int v: ad[u]) {
if (v == p) continue;
mx = max(mx, dfs(v, u, lb));
}
mx = max(mx, lb[u]);
lb[u] = (lb[u] << 10) + mx;
return mx;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
ct = 0;
for (int i = 0; i < n; i++){
ad[i].clear();
}
for (int i = 0; i < n - 1; i++){
ad[u[i]].push_back(v[i]);
ad[v[i]].push_back(u[i]);
}
dfs(0, -1, labels);
// for (int i = 0; i < n; i++){
// cout << i << " " << (labels[i] >> 10) << " " << (labels[i] & ((1 << 10) - 1)) << "\n";
// }
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if (t < s || (s & ((1 << 10) - 1)) < (t >> 10)) return c[0];
for (int i = 1; i < c.size(); i++){
if (c[i] == t) return c[i];
if (c[i] > t) return c[i-1];
}
return c.back();
}
Compilation message (stderr)
# | 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... |