# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362022 | valerikk | Stations (IOI20_stations) | C++17 | 1055 ms | 1080 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 = 1000;
vector<int> g[N];
int t = 0;
vector<int> l;
int dfs(int v, int p = -1) {
l[v] = t++;
int mx = l[v];
for (int u : g[v]) {
if (u != p) mx = max(mx, dfs(u, v));
}
l[v] *= N;
l[v] += mx;
return mx;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i = 0; i < n; i++) g[i].clear();
for (int i = 0; i < n - 1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
l.resize(n);
dfs(0);
return l;
}
int find_next_station(int s, int t, vector<int> c) {
assert(s != t);
int p;
for (int v : c) {
if (v / N <= s / N && s / N <= v % N) p = v; else {
if (v / N <= t / N && t / N <= v % N) return v;
}
}
return p;
}
#ifdef LOCAL
int main(){
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif
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... |