Count The Pairs

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #include<vector>
 6 using namespace std;
 7 const int N=1e5+10;
 8 const int M=5e5+10;
 9 int n,m,q,u,v,top,temp;
10 int fa[N],sum[N],ans[N];
11 struct Node{
12    int u,v;
13    int w;
14    bool operator<(const Node a)const {
15      if(w!=a.w)
16         return w<a.w;
17      else
18         return u<a.u;
19    }
20 }edge[M];
21 void init(){
22   for(int i=1;i<=n;i++){
23       fa[i]=i;
24       sum[i]=1;
25   }
26   top=0;
27   memset(ans,0,sizeof(ans));
28 }
29 int Find(int x){
30    int s;
31    for(s=x;s!=fa[s];s=fa[s]);
32    while(s!=x){
33       int temp=fa[x];
34       fa[x]=s;
35       x=temp;
36    }
37   return s;
38 }
39 int main(){
40     while(~scanf("%d%d",&n,&m)){
41         init();
42         for(int i=1;i<=m;i++){
43            scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
44            edge[i].v++;edge[i].u++;
45         }
46        sort(edge+1,edge+m+1);
47         vector<int>Q;
48        for(int i=1;i<=m;i++){
49           int x=Find(edge[i].u);
50           int y=Find(edge[i].v);
51           if(x!=y){
52              ans[++top]=sum[x]*sum[y]*2;
53              fa[x]=y;
54              sum[y]+=sum[x];
55              Q.push_back(edge[i].w);
56           }
57        }
58        for(int i=1;i<=top;i++)
59           ans[i]+=ans[i-1];
60        scanf("%d",&q);
61        for(int i=1;i<=q;i++){
62          scanf("%d",&temp);
63          int id=lower_bound(Q.begin(),Q.end(),temp)-Q.begin();
64          printf("%d\n",ans[top]-ans[id]);
65        }
66     }
67 }