题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4750
题意:给定一个边权都不一样的图,然后给出10W个询问,每个询问有个T,求图中任意两点所有路径中满足最长边中的最小值(瓶颈边)大于等于T的(s,t)对数
思路:按kruskal的顺序合并边,每次合并边,可以发现每次合并的那条边,就是连接两个集合的瓶颈路(最小生成树中边权最大那条边),这样就可以求出以这条边为瓶颈边的顶点对数
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 10010;
const int M = 500010;
int sum[N];
int fa[N];
int tot[N];
int cnt;
vector <int> v;
struct edge
{
int a, b, w;
edge() {}
edge(int a, int b, int w) : a(a), b(b), w(w) {}
bool operator < (const edge &rhs) const
{
return w < rhs.w;
if(a != rhs.a)
return a < rhs.a;
if(b != rhs.b)
return b < rhs.b;
}
} e[M];
void init()
{
cnt = 1;
v.clear();
for(int i = 0; i <= N; i++)
{
fa[i] = i;
sum[i] = 1;
}
memset(tot, 0, sizeof(tot));
}
int Find(int x)
{
if(x == fa[x])
return x;
return fa[x] = Find(fa[x]);
}
int main()
{
int n, m, q;
while(~scanf("%d%d", &n, &m))
{
init();
for(int i = 0; i < m; i++)
{
int a, b, w;
scanf("%d%d%d", &a, &b, &w);
e[i] = edge(a, b, w);
}
sort(e, e + m);
for(int i = 0; i < m; i++)
{
int fx = Find(e[i].a);
int fy = Find(e[i].b);
if(fx != fy)
{
v.push_back(e[i].w);
tot[cnt++] = sum[fx] * sum[fy] * 2;
sum[fy] += sum[fx];
fa[fx] = fy;
}
}
for(int i = 1; i < cnt; i++)
tot[i] += tot[i - 1];
scanf("%d", &q);
for(int i = 0; i < q; i++)
{
int w;
scanf("%d", &w);
int idx = lower_bound(v.begin(), v.end(), w) - v.begin();
printf("%d\n", tot[cnt - 1] - tot[idx]);
}
}
return 0;
}