货车运输 2013年提高组D1T3

一次写过

#include<bits/stdc++.h>
using namespace std;
struct node{
	int x,y,z;
}a[50010];
struct node2{
	vector<int>obj,dis;
}pass[50010];
int fat[10010],fat2[10010],fat3[10010],dep[10010],anc[10010][20];
int cmp(node q,node p){
	return q.z>p.z;
}
int find(int t){
	if(fat[t]==t)return t;
	return fat[t]=find(fat[t]);
}
int find2(int t){
	if(fat2[t]==0)return t;
	return find2(fat2[t]);
}
void dfs(int t,int u){
	dep[t]=u;
	for(int k=0;k<pass[t].obj.size();k++)
		if(dep[pass[t].obj[k]]==0){
			fat2[pass[t].obj[k]]=t;
			fat3[pass[t].obj[k]]=pass[t].dis[k];
			dfs(pass[t].obj[k],u+1);
		}
}
int lca(int q,int p){
	if(dep[q]<dep[p]){
		int t=q;
		q=p;
		p=t;
	}
	int j,sum;
	for(sum=0;(1<<sum)<=dep[q];sum++);
	sum--;
	for(j=sum;j>=0;j--)
		if(dep[q]-(1<<j)>=dep[p])
			q=anc[q][j];
	if(q==p)return q;
	for(j=sum;j>=0;j--)
		if(anc[q][j]&&anc[q][j]!=anc[p][j]){
			q=anc[q][j];
			p=anc[p][j];
		}
	return fat2[q];
}
int main(){
	int t,n,m,i,j,q,p,ans1,ans2,kase;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
		fat[i]=i;
	for(i=1;i<=m;i++)
		scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
	sort(a+1,a+1+m,cmp);
	for(i=1;i<=m;i++){
		q=find(a[i].x);
		p=find(a[i].y);
		if(q!=p){
			fat[q]=p;
			pass[a[i].x].obj.push_back(a[i].y);
			pass[a[i].x].dis.push_back(a[i].z);
			pass[a[i].y].obj.push_back(a[i].x);
			pass[a[i].y].dis.push_back(a[i].z);
		}
	}
	for(i=1;i<=n;i++)
		if(dep[i]==0)dfs(i,1);
	for(i=1;i<=n;i++)
		anc[i][0]=fat2[i];
	for(j=1;(1<<j)<=n;j++)
		for(i=1;i<=n;i++)
			if(anc[i][j-1]&&anc[anc[i][j-1]][j-1])
				anc[i][j]=anc[anc[i][j-1]][j-1];
	scanf("%d",&kase);
	while(kase--){
		scanf("%d%d",&q,&p);
		if(find2(q)!=find2(p)){
			printf("-1\n");
			continue;
		}
		t=lca(q,p);
		ans1=2e9;
		while(1){
			if(q==t)break;
			ans1=min(ans1,fat3[q]);
			q=fat2[q];
		}
		ans2=2e9;
		while(1){
			if(p==t)break;
			ans2=min(ans2,fat3[p]);
			p=fat2[p];
		}
		printf("%d\n",min(ans1,ans2));
	}
	return 0;
}