# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305295 | abeker | Stations (IOI20_stations) | C++17 | 1049 ms | 1280 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;
typedef pair <int, int> pii;
vector <int> label(int N, int K, vector <int> u, vector <int> v) {
vector <vector <int>> adj(N);
for (int i = 0; i < N - 1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int timer = 0;
vector <pii> sorted;
vector <int> labels(N);
function <void(int, int, int)> dfs = [&](int x, int p, int d) {
int disc = timer++;
for (auto it : adj[x])
if (it != p)
dfs(it, x, d ^ 1);
int fin = timer++;
sorted.push_back({d ? fin : disc, x});
};
dfs(0, -1, 0);
sort(sorted.begin(), sorted.end());
for (int i = 0; i < N; i++)
labels[sorted[i].second] = i;
return labels;
}
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... |