POJ 题目3723 Conscription(最小生成树变形)
来源:互联网 发布:vscode 导出配置 编辑:程序博客网 时间:2024/06/06 13:20
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
25 5 84 3 68311 3 45830 0 65920 1 30633 3 49751 3 20494 2 21042 2 7815 5 102 4 98203 2 62363 1 88642 4 83262 0 51562 0 14634 1 24390 4 43733 4 88892 4 3133
Sample Output
7107154223
Source
#include<stdio.h>#include<string.h>#include<stdlib.h>struct s{int u,v,w;}b[50020];int pre[50020];int find(int x){if(x==pre[x])return x;return pre[x]=find(pre[x]);}void init(int n){int i;for(i=0;i<=2*n;i++)pre[i]=i;}int cmp(const void *a,const void *b){return (*(struct s *)b).w-(*(struct s *)a).w;}int main(){int t;scanf("%d",&t);while(t--){int n,m,r;int i;scanf("%d%d%d",&n,&m,&r);init(n);int ans=10000*(n+m);for(i=0;i<r;i++){int x,y,z;scanf("%d%d%d",&x,&y,&z);b[i].u=x;b[i].v=y+n;b[i].w=z;}qsort(b,r,sizeof(b[0]),cmp);for(i=0;i<r;i++){int x=b[i].u;int y=b[i].v;int fa=find(x);int fb=find(y);if(fa!=fb){pre[fa]=fb;ans-=b[i].w;}}printf("%d\n",ans);}}
- POJ 题目3723 Conscription(最小生成树变形)
- poj 3723 Conscription (最小生成树)
- POJ 3723 Conscription(最小生成树)
- Conscription 3723(最小生成树变形)
- POJ 3723 Conscription 最小生成树 克鲁斯卡尔算法变形
- poj 3723 Conscription ---最小生成树
- 【POJ】3723 Conscription 最小生成树
- POJ 3723 Conscription【最小生成树】
- POJ, 3723 Conscription(最小生成树)
- POJ-3723 Conscription(最小生成树)
- poj 3723 Conscription(最小生成树)
- POJ 3273 Conscription(最小生成树)
- poj 3723 Conscription(最小生成树拓展)
- POJ 3723 Conscription(最小生成树-Kruskal)
- POJ 3723 Conscription(最小生成树--kruskul)
- POJ - 3723 Conscription(最小生成树Kruskal,思路)
- poj 3723 Conscription 【最小生成树(克鲁斯卡尔)】
- POJ 3723 Conscription(构造+最小生成树Kruskal)
- CSS规范
- Android 插件化技术 加载任意未安装apk
- 黑马程序员--04C预处理
- NYOJ 374 弹球II
- 1075. PAT Judge (25)
- POJ 题目3723 Conscription(最小生成树变形)
- typedef void (^funcblock)(void);
- iOS 模糊搜索
- [Codeforces #295(Div 2)]简要题解
- gradle多渠道打包及友盟统计-eclipse版本
- 1076. Forwards on Weibo (30)
- 最小生成树末班
- 黑马程序员——Math.random小结
- hdu 1028 Ignatius and the Princess III 母函数水题,,大家注意了,,我要开始刷母函数了~~