2021CCPC东北四省赛 K. City 并查集

传送门

分析

应该比较好判断的是这道题的本质和图论无关，只需要判断联通快大小即可
但是这道题的边是有选择性的，那我们怎么去做呢？
我们发现这些边的加入应该是有一定单调性的，也就是说边权越大的边越容易加进去
所以，我们考虑对边权进行排序，然后对所有的询问进行离线处理

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
	int x,y,z;
}tr[N];

struct question{
	int x,id;
}Q[N];
int n,m,q;
int p[N];
ll sz[N];
ll ans[N];

bool cmp1(Node A,Node B){
	return A.z > B.z;
}

bool cmp2(question A,question B){
	return A.x > B.x;
}

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

int main() {
	int T;
	read(T);
	while(T--){
		read(n),read(m),read(q);
		for(int i = 1;i <= n;i++) p[i] = i,sz[i] = 1;
		for(int i = 1;i <= m;i++) read(tr[i].x),read(tr[i].y),read(tr[i].z);
		sort(tr + 1,tr + 1 + m,cmp1);
		for(int i = 1;i <= q;i++) read(Q[i].x),Q[i].id = i;
		sort(Q + 1,Q + 1 + q,cmp2);
		int l = 1;
		ll sum = 0;
		for(int i = 1;i <= q;i++){
			int x = Q[i].x;
			for(;l <= m && tr[l].z >= x;l++){
				int x = find(tr[l].x),y = find(tr[l].y);
				if(x != y){
					sum += sz[x] * sz[y];
					p[x] = y;
					sz[y] += sz[x];
				}
			}
			ans[Q[i].id] = sum;
		}
		for(int i = 1;i <= q;i++) dl(ans[i]);
	}
	return 0;
}