# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171426 | dolphingarlic | Synchronization (JOI13_synchronization) | C++14 | 984 ms | 23928 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 F(y)for(int i=1;i<y;i++)
#define x first
#define y second
using namespace std;
const int N=200001;
vector<int> g[N];
pair<int,int> e[N];
int n,m,q,f[N],l[N],t=1,tin[N],tout[N],c[N][20],b[N];
void dfs(int v=1,int p=0){
c[v][0]=p;
F(20)c[v][i]=c[c[v][i - 1]][i - 1];
f[v]=1;
tin[v]=t++;
for(int i : g[v])if(i != p)dfs(i,v);
tout[v]=t;
}
void up(int p,int val){for(; p <= n; p +=(p &(-p)))b[p] += val;}
int qu(int p){
int ans=0;
for(; p; p -=(p &(-p)))ans += b[p];
return ans;
}
int lca(int v){
int ll=v;
for(int i=19;~i;i--)if(c[ll][i]&&qu(tin[c[ll][i]])==qu(tin[v]))ll=c[ll][i];
return ll;
}
main(){
cin >> n >> m >> q;
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... |