# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960491 | abczz | Mergers (JOI19_mergers) | C++14 | 1121 ms | 203364 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 <iostream>
#include <vector>
#include <array>
#define ll long long
using namespace std;
vector <ll> adj[500000];
vector <ll> G[500000];
vector <array<ll, 2>> edge;
ll n, k, a, b, p, cnt, f, A[500000], dp[500000], D[500000], H[500000], P[500000], bl[500000][19], deg[500000];
ll dsu(ll u) {
if (P[u] == u) return u;
else return P[u] = dsu(P[u]);
}
void dfs(ll u, ll p) {
for (auto v : adj[u]) {
if (v != p) {
D[v] = D[u]+1;
dfs(v, u);
bl[v][0] = u;
}
}
}
ll lca(ll a, ll b) {
if (D[a] > D[b]) swap(a, b);
ll db = D[b];
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... |