# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205800 | PeppaPig | Railway (BOI17_railway) | C++14 | 166 ms | 24692 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>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 1e5+5;
int n, m, k;
int in[N], out[N], pos[N], hv[N], sz[N];
vector<pii> g[N];
int dfs(int u, int p) {
static int idx = 0;
pii ret(0, -1);
pos[in[u] = ++idx] = u, sz[u] = 1;
for(pii v : g[u]) if(v.x != p) {
int z = dfs(v.x, u);
sz[u] += z, ret = max(ret, pii(z, v.x));
}
hv[u] = ret.y, out[u] = idx;
return sz[u];
}
vector<int> vec[N], ans;
int pol_sz[N], cnt[N], cur_ans;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |