Description
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege, he must pay 10000 RMB. There are some relationships between girls and boys and Windy can use these relationships to reduce his cost. If girl x and boy y have a relationship d and one of them has been collected, Windy can collect the other one with 10000-d RMB. Now given all the relationships between girls and boys, your assignment is to find the least amount of money Windy has to pay. Notice that only one relationship can be used when collecting one soldier.
Input
The first line of input is the number of test case.
The first line of each test case contains three integers, N, M and R.
Then R lines followed, each contains three integers xi, yi and di.
There is a blank line before each test case.
1 ≤ N, M ≤ 10000
0 ≤ R ≤ 50,000
0 ≤ xi < N
0 ≤ yi < M
0 < di < 10000
Output
Sample Input
2 5 5 8 4 3 6831 1 3 4583 0 0 6592 0 1 3063 3 3 4975 1 3 2049 4 2 2104 2 2 781 5 5 10 2 4 9820 3 2 6236 3 1 8864 2 4 8326 2 0 5156 2 0 1463 4 1 2439 0 4 4373 3 4 8889 2 4 3133
Sample Output
71071 54223dasd
把人看做顶点,把关系看左边,就把问题转化成了求解无向图中的最大权森林问题。
可以通过把所有边权取反用最小生成树算法求解
#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #define MAX_N 50050 using namespace std; struct edge{ int u,v,cost; }; bool comp(const edge& e1, const edge& e2){ return e1.cost < e2.cost; } //input int E,V,N,M,R; int x[MAX_N], y[MAX_N], d[MAX_N]; //并查集 int par[MAX_N]; int rank[MAX_N]; void init(int n){ for(int i = 0;i < n; i++){ par[i] = i; rank[i] = 0; } } int find(int x){ if(par[x] == x) return x; else return par[x] = find(par[x]); } void unite(int x, int y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] < rank[y]){ par[x] = y; }else{ par[y] = x; if(rank[x] == rank[y]) rank[x]++; } } bool same(int x, int y){ return find(x) == find(y); } edge es[MAX_N]; //顶点数和边数 int kruskal(){ sort(es, es + R, comp); init(V); int res = 0; for(int i = 0;i < R; i++){ edge e = es[i]; if(!same(e.u, e.v)){ unite(e.u, e.v); res += e.cost; } } return res; } void solve(){ V = N + M; E = R; for(int i = 0;i < R; i++){ es[i] = (edge){x[i], N + y[i], -d[i]}; } printf("%d\n", 10000 * (N + M) + kruskal()); } int main(){ //freopen("in","r",stdin); int t; scanf("%d",&t); while(t--){ scanf("%d%d%d", &N, &M, &R); for(int i = 0;i < R; i++){ scanf("%d%d%d", &x[i], &y[i], &d[i]); } solve(); } return 0; }