# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072882 | Ignut | Stations (IOI20_stations) | C++17 | 1021 ms | 2140 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.
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1111;
vector<int> tree[N];
vector<int> euler;
int root;
void dfs(int v, int par) {
euler.push_back(v);
for (int to : tree[v]) {
if (to != par) {
dfs(to, v);
if (v == root)
euler.push_back(v);
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
euler.clear();
for (int i = 0; i < n; i ++) {
tree[i].clear();
}
for (int i = 0; i < n - 1; i ++) {
tree[u[i]].push_back(v[i]);
tree[v[i]].push_back(u[i]);
}
root = 0;
for (int i = 0; i < n; i ++)
if (tree[i].size() > 2)
root = i;
dfs(root, -1);
vector<int> lbl(n);
lbl[root] = 0;
int number = 1;
for (int v : euler) {
if (v == root) {
number = (number / 1000 + 1) * 1000;
number ++;
continue;
}
lbl[v] = number ++;
}
for (int val : lbl) cerr << val << ' ';
cerr << '\n';
return lbl;
}
int find_next_station(int s, int t, vector<int> c) {
for (int val : c) cerr << val << ' ';
cerr << '\n';
if (c.size() > 2) {
for (int v : c) {
if (v / 1000 == t / 1000)
return v;
}
t /= 0;
return t;
}
if (c.size() == 1)
return c[0];
int mn = min(c[0], c[1]);
int mx = max(c[0], c[1]);
if (mn == t) return t;
if (mx == t) return t;
if (mx / 1000 == t / 1000) {
if (mx % 1000 < t % 1000)
return mx;
return mn;
}
if (mx / 1000 == s / 1000)
return mn;
s /= 0;
return mx;
}
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... |