【五校联考3day1】旅游

【五校联考3day1】旅游

Description

Input

Output

Sample Input

1
5 5 3
2 3 6334
1 5 15724
3 5 5705
4 3 12382
1 3 21726
6000
10000
13000

Sample output

2
6
12

Data Constraint

题解

比较典型的离线问题
按照边的权值和询问排序，再用并查集维护，顺便记录每个集合的大小

code

#include<cstdio>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#define N 20100
#define R register int
using namespace std;
inline void read(int &x){
	x=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
}
struct node{int x,y,d;}edga[N*5];
struct Node{int d,pos;}a[N];
int t,n,m,q,fa[N],ans[N],size[N],tot,j;
bool cmp1(node x,node y){return x.d<y.d;}
bool cmp2(Node x,Node y){return x.d<y.d;}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main(){
	read(t);
	while(t--){
		read(n),read(m),read(q),tot=0;
		for(R i=1;i<=m;++i)read(edga[i].x),read(edga[i].y),read(edga[i].d);
		for(R i=1;i<=q;++i)read(a[i].d),a[i].pos=i;
		for(R i=1;i<=n;++i)fa[i]=i,size[i]=1;
		sort(edga+1,edga+1+m,cmp1),sort(a+1,a+1+q,cmp2);
		j=0;
		for(R i=1;i<=q;++i){
			while(j<m&&edga[j+1].d<=a[i].d){
				++j;
				R x=find(edga[j].x),y=find(edga[j].y);
				if(x!=y)fa[y]=x,tot+=2*size[x]*size[y],size[x]+=size[y];
			}
			ans[a[i].pos]=tot;
		}
		for(R i=1;i<=q;++i)printf("%d\n",ans[i]);
	}
}