# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427788 | Pajaraja | Meetings 2 (JOI21_meetings2) | C++17 | 1110 ms | 49876 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 MAXN 200007
#define MAXL 20
using namespace std;
vector<int> g[MAXN],v[MAXN];
int p[MAXL][MAXN],d[MAXN],n,ans[MAXN],c,in[MAXN],out[MAXN],t;
int dfsc(int s,int f,int dub)
{
p[0][s]=f;
in[s]=t++;
d[s]=dub;
bool centroid=true;
int sum=1;
for(int i=0;i<g[s].size();i++) if(g[s][i]!=f)
{
int a=dfsc(g[s][i],s,dub+1);
if(a>n/2) centroid=false;
sum+=a;
}
if(n-sum>n/2) centroid=false;
if(centroid) c=s;
out[s]=t++;
return sum;
}
bool insub(int u,int v) {return in[u]>=in[v] && out[u]<=out[v];}
int lca(int u,int v)
{
if(insub(u,v)) return v;
if(insub(v,u)) return u;
for(int i=MAXL-1;i>=0;i--) if(!insub(v,p[i][u])) u=p[i][u];
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... |