ACM LCA 倍增 模板 HDU 5044

LCA 倍增模板O(N*log N),N为点数

题目：HDU 5044

最近公共祖先(Least Common Ancestors) LCA

//fa[x][i]表示x往上跳2^i次的祖先
//h[x]表示x所在的层数（深度）
int LCA(int l,int r){
    int x=l,y=r;
    if (h[x]<h[y]){int tmp = x;x=y;y=tmp; }//深度大的跳到深度小的
    FORD(i,16,0){ //for downto for i=16 downto 0
        if (h[fa[x][i]]>h[y]) x = fa[x][i];
    }
    x = fa[x][0];
    if (x==y) return x;

    FORD(i,16,0){//两个同时往上跳
        if (fa[x][i]!=fa[y][i]){
            x = fa[x][i];
            y = fa[y][i];
        }
    }
    x = fa[x][0];
    return x;
}

原题（未通过，边的询问还没有处理）

#include <stdio.h>
#include <queue>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define FOR(i,a,b) for (int i = a; i <=b; i ++)
#define FORD(i,a,b) for (int i = a; i >=b; i --)
#define mem(a, b) memset(a, b, sizeof(a))
#define Sqr(x) ((x) * (x))

typedef long long LL;

using namespace std;


bool flag[100100],leaves[100100],vis[100100];
int fa[100100][20];
int R[200200],next[200200],h[100100];
int head[100100],P[100100],ans[100100],e_index[200200];
int eNum,n,m;

void Add(int l,int r,int index){
    eNum ++;R[eNum] = r;e_index[eNum] = index;next[eNum] = head[l];head[l] = eNum;
    eNum ++;R[eNum] = l;e_index[eNum] = index;next[eNum] = head[r];head[r] = eNum;
}

void dfs(int x){
    flag[x] = true;
    int p = head[x];
    while (p){
        int y = R[p];
        if (!flag[y]){
            fa[y][0] = x;
            head_e[y] = e_index[p];
            leaves[x] = false;
            h[y] = h[x]+1;
            FOR(i,1,16){
                fa[y][i] = fa[fa[y][i-1]][i-1];
            }
            dfs(y);
        }
        p = next[p];
    }
}

//fa[x][i]表示x往上跳2^i次的祖先
//h[x]表示x所在的层数（深度）
int LCA(int l,int r){
    int x=l,y=r;
    if (h[x]<h[y]){int tmp = x;x=y;y=tmp; }//深度大的跳到深度小的
    FORD(i,16,0){ //for downto for i=16 downto 0
        if (h[fa[x][i]]>h[y]) x = fa[x][i];
    }
    x = fa[x][0];
    if (x==y) return x;

    FORD(i,16,0){//两个同时往上跳
        if (fa[x][i]!=fa[y][i]){
            x = fa[x][i];
            y = fa[y][i];
        }
    }
    x = fa[x][0];
    return x;
}

int main(){
    int cases;
	scanf("%d",&cases);
	FOR(turns,1,cases){
        scanf("%d%d",&n,&m);
        eNum = 1;
        memset(R,0,sizeof(R));
        memset(next,0,sizeof(next));
        memset(head,0,sizeof(head));

        FOR(i,1,n-1){
            int l,r;
            scanf("%d%d",&l,&r);
            Add(l,r,i);
        }
        memset(P,0,sizeof(P));
        memset(fa,0,sizeof(fa));
        memset(leaves,true,sizeof(leaves));


        //
        h[1] = 1;
        dfs(1);
        /*FOR(i,1,4){
            cout<<i<<": ";
            FOR(j,0,5) cout<<fa[i][j]<<" ";
            cout<<endl;
        }*/
        FOR(i,1,m){
            char s[10];
            scanf("%s",s);
            int ch,l,r,k;
            scanf("%d%d%d",&l,&r,&k);
            if (s[3]=='1'){
                int lca = LCA(l,r);
                P[lca] -= k;
                P[fa[lca][0]] -= k;
                P[l] += k;
                P[r] += k;

            } else
            if (s[3]=='2'){
                int lca = LCA(l,r);
                E[lca] -= k;
                E[fa[lca][0]] -= k;
                E[l] += k;
                E[r] += k;
            }
        }

        memset(ans,0,sizeof(ans));
        memset(ans_e,0,sizeof(ans_e));
        memset(vis,0,sizeof(vis));
        queue<int> q;
        FOR(i,1,n)
            if (leaves[i]) {
                vis[i]=true;
                q.push(i);
            }

        while (!q.empty()){

            int x = q.front();q.pop();
            int y = fa[x][0];
            ans[x] += P[x];
            ans_e[x] += E[x];
            ans[y] += ans[x];
            ans_e[y] += E
            if (!vis[y]) {
                vis[y] = true;
                q.push(y);
            }
        }
        printf("Case #%d:\n",turns);
        FOR(i,1,n) {
            printf("%d",ans[i]);
            if (i!=n) printf(" "); else printf("\n");
        }
	}
	return 0;
}