LCA之tarjan HDU 2586

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#define M 40000*2+100
#define Max 40000+100
#define nodes(i,a,begin,next) for(int i = begin[a]; i; i=next[i])
#define rep(i,a,b) for(int i=a; i<=b; ++i)
#define per(i,a,b) for(int i=a; i>=b; --i)
#define repc(i,a,b,c) for(int i=a; i<=b; i+=c)
#define read(a) scanf("%d",&a)
#define writeln(a) printf("%d\n",a) 

using namespace std;
int e, to[M], nxt[M], bgn[M], w1[M];
int e1, to1[M], nxt1[M], bgn1[M], w2[M];
int f[M], p[M], dep[M];

int n,m;
int find(int x) {if (f[x]!=x) return f[x] = find(f[x]); else return x;}
int xor_(int i) {if(i&1) return i+1; else return i-1;}

void dfs(int h,int dep_)
{ 
  p[h] = 1; dep[h] = dep_;
  nodes(i,h,bgn,nxt) { int y = to[i]; if(p[y]) continue; dfs(y, dep_+w1[i]); f[y] = h;}
  nodes(i,h,bgn1,nxt1) { int y = to1[i]; if(p[y]) w2[xor_(i)] = w2[i] = dep[h] + dep[y] - 2*dep[find(y)];}
}

void add(int x,int y,int z) { ++e; to[e] = y; nxt[e] = bgn[x]; bgn[x] = e; w1[e]=z;}
void add1(int x,int y) { ++e1; to1[e1] = y; nxt1[e1] = bgn1[x]; bgn1[x] = e1;} 

int u,v,w,T;
int main()
{ 
   char ch[20];
   read(T);
   while(T--)
   {
   	 read(n);read(m);
   	 memset(bgn,0,sizeof(bgn));
   	 memset(bgn1,0,sizeof(bgn1));
   	 memset(dep,0,sizeof(dep));
   	 memset(p,0,sizeof(p));
   	 e = 0 ; e1 = 0;
     rep(i,1,Max) f[i] = i;
     rep(i,1,n-1) read(u),read(v),read(w),add(u,v,w),add(v,u,w);
     rep(i,1,m) read(u),read(v),add1(u,v),add1(v,u); 
     dfs(1,0);
     repc(i,1,m*2,2) writeln(w2[i]);
  }
} 确实水水的秒掉了