# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309308 | arnold518 | Construction of Highway (JOI18_construction) | C++14 | 423 ms | 16496 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
int N;
vector<int> adj[MAXN+10];
int A[MAXN+10], B[MAXN+10];
int par[MAXN+10], sz[MAXN+10];
void dfs(int now)
{
sz[now]=1;
for(int nxt : adj[now])
{
dfs(nxt);
sz[now]+=sz[nxt];
}
}
int head[MAXN+10], dfn[MAXN+10], idfn[MAXN+10], cnt;
void hld(int now)
{
dfn[now]=++cnt;
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... |