# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
311935 | denverjin | Stations (IOI20_stations) | C++14 | 1267 ms | 1072 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
vector <int> label(int n, int k, vector <int> u, vector <int> v) {
vector <vector <int> > g(n);
rep(i, n - 1) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
vector <int> dfn(n), ed(n), dep(n);
int tme = 0;
function <void(int, int)> dfs;
dfs = [&] (int u, int p) {
dfn[u] = tme ++;
rep(i, g[u].size()) {
int v = g[u][i];
if (v == p) continue;
dep[v] = dep[u] + 1;
dfs(v, u);
}
ed[u] = tme ++;
};
# | 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... |