poj3723最小生成树
来源:互联网 发布:linux创建新文件 编辑:程序博客网 时间:2024/05/17 07:22
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
#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;const int maxn=1e5+10;struct edge{ int u,v,cost;}es[maxn];bool cmp(edge e1,edge e2){ return e1.cost<e2.cost;}int par[maxn],rank[maxn];void init(int n){ for(int i=0; i<=n; i++) { rank[i]=0; par[i]=i; }}int find(int i){ if(i==par[i]) return i; return par[i]=find(par[i]);}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);}int V,E,R;int t,N,M;int kruskal(){ sort(es,es+E,cmp); init(V); int res=0; for(int i=0; i<E; i++) { edge e=es[i]; if(!same(e.u,e.v)) { unite(e.u,e.v); res+=e.cost; } } return res;}int main(){ cin>>t; while(t--) { ///cin>>N>>M>>R; scanf("%d%d%d",&N,&M,&R); V=N+M; E=R; int u,v,cost; for(int i=0;i<R;i++) { scanf("%d%d%d",&u,&v,&cost); /// cin>>u>>v>>cost; es[i].u=u; es[i].v=v+N; es[i].cost=-cost; } cout<<kruskal()+10000*(N+M)<<endl; } return 0;}
- poj3723最小生成树
- [POJ3723] Conscription [最小生成树]
- 最小生成树 POJ3723 Conscription
- POJ3723 招募士兵[最小生成树]
- poj3723 Conscription(最小生成树)
- POJ3723 Conscription , 最大权森林问题 ->最小生成树问题
- poj3723(最大生成树)
- poj Kruskal 【poj3723 Conscription : 最大生成树;poj 1251 Jungle Roads: 最小生成树poj1861Network】
- 《挑战程序设计竞赛》2.5.2 最小生成树 POJ3723 3169 1258 2377 2395 AOJ2224(1)
- POJ3723 Conscription 解题报告【Kruskal/最大生成树】
- POJ3723
- poj3723
- poj3723
- poj3723
- poj3723
- POJ3723最大(或者小)生成树,构建军队,不错的题目
- poj3723 Conscription Kruscal算法最大生成森林
- 最小比例 最小生成树
- RS485驱动
- popwindow与editText 软键盘弹出问题
- HoneyComb3.0技术系列之StackView
- 内置函数map.fitler.reduce,偏函数,zip
- Programming Reflection
- poj3723最小生成树
- 什么是DOM?DOM和JavaScript的关系[web开发]
- More Effective C++ 第五部分 技术
- ARM处理器启动流程及bootlader架构设计
- leetcode -- 利用python统计string中的频率问题
- ScrollView中内容自动滑动至底部
- Struts问题: IllegalArgumentException occurred while calling setter of com.zzuli.
- 配置hive1.2.1,并更改元数据库为mysql
- 使用iptables和tc来进行限速