AcWing 1171. 距离 题解（最近公共祖先）

AcWing 1171. 距离
用vector+pair记录离线查询，好好记一下
利用最近公共祖先算出树上两点距离，好好学一下

#include<bits/stdc++.h>

using namespace std;

#define x first
#define y second

typedef pair<int, int>PII;

const int N = 10010, M = N * 2;

int res[M];  //根据边记录结果，所以范围要和存边变量的范围相同 
int n, m;
vector<PII>query[N];  //记录查询
int h[N], e[M], ne[M],w[M], idx;
int st[N];  //标记这个点是否被深搜过
int dist[N];
int p[N];  //并查集数组
 
void add(int a, int b, int c){
	e[idx] = b;
	w[idx] = c;
	ne[idx] = h[a];
	h[a] = idx ++ ;
} 

void dfs(int u, int fa){  //更新距离 
	for(int i = h[u]; ~i; i = ne[i]){
		int j = e[i];
		if(j == fa) continue;
		dist[j] = dist[u] + w[i];  //更新树上距离 
		dfs(j, u);  //继续深搜 
	}	
}

int find(int u){
	if(u != p[u]) p[u] = find(p[u]);
	return p[u];
}

void tarjan(int u){
	st[u] = 1;  //标记这个点正在被搜索
	for(int i = h[u]; ~i; i = ne[i]){
		int j = e[i];
		if(!st[j]){  //如果这个点没搜索过 
			tarjan(j);  //对子节点继续更新 
			p[j] = u;
		}
	}
	
	for(auto op : query[u]){  //遍历所有和u有关的查询
		
		int t = op.x, id = op.y;  //记录节点和编号
		if(st[t] == 2){
			int anc = find(t);  //找到u的祖宗节点 
			res[id] = dist[t] + dist[u] - 2 * dist[anc];
		}  
	}
	st[u] = 2;
} 

int main()
{
	scanf("%d%d", &n, &m);
	memset(h, -1, sizeof h);
	for(int i = 0; i < n - 1; i ++ ){
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		//双向边 
		add(a, b, c);
		add(b, a, c);
	}
	
	for(int i = 0; i < m; i ++ ){
		int a, b;
		scanf("%d%d", &a, &b);
		if(a != b){
			query[a].push_back({b, i});
			query[b].push_back({a, i});		
		}
		
	} 
	
	for(int i = 1;i <= n; i ++ ) p[i] = i;
	
	dfs(1, -1);
	tarjan(1);
	
	for(int i = 0; i < m; i ++ ){
		cout<<res[i]<<endl;
	}
	return 0;
}