# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362050 | valerikk | Stations (IOI20_stations) | C++17 | 1099 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>
using namespace std;
const int N = 1007;
vector<int> g[N];
int a[N], b[N], C, dep[N];
void dfs(int v,int d = 0, int p =-1){
a[v] = C++;
dep[v] = d;
for(int u : g[v]){
if (u!= p) {
dfs(u, d + 1, v);
}
}
b[v] = C++;
}
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]);
}
C = 0;
dfs(0);
vector<int> L(n), LL;
for(int i =0 ; i < n ; i++) {
L[i] = (dep[i]&1) ? b[i] : a[i];
LL.push_back(L[i]);
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... |