# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138132 | Mahmoud_Adel | Mergers (JOI19_mergers) | C++14 | 799 ms | 99080 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;
#define f first
#define s second
typedef long long ll;
const int N = 5e5+5;
int n, m, ans, cur, s[N], dep[N], sp[N][20], sub[N], ret[N], mark[N], deg[N];
vector<int> adj[N], vec[N];
void pre(int u, int p)
{
sub[u] = 1;
dep[u] = dep[p]+1;
sp[u][0] = p;
for(int i=1; i<20; i++) sp[u][i] = sp[sp[u][i-1]][i-1];
for(int v : adj[u]) if(v != p) pre(v, u), sub[u] += sub[v];
}
int equate(int u, int v)
{
int c = dep[u]-dep[v];
for(int i=0; i<20; i++) if(c & (1<<i)) u = sp[u][i];
return u;
}
int LCA(int u, int v)
{
if(dep[u] < dep[v]) swap(u, v);
u = equate(u, v);
if(u == v) return u;
for(int i=19; i>=0; i--) if(sp[u][i] != sp[v][i]) u = sp[u][i], v = sp[v][i];
return sp[u][0];
}
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... |