poj 3723 Conscription(最小生成树)
来源:互联网 发布:power mac g4改装 编辑:程序博客网 时间:2024/06/05 00:30
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
POJ Monthly Contest – 2009.04.05, windy7926778
男女都是从0开始,为了在一颗树上,可以在男兵的序号加上n,即从0-n, 0-m变成了0-m+n。每条边的权值是可以省去的费用,如过没有边,总费用是(m+n)*10000,现在可以将边的权值改成负值,这样就把最大权森林问题变成了最小生成树问题了。
Kruskal算法实现代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1e5+5;int n, m, r, k, pre[maxn];struct node{ int u, v, w; node() {} node(int uu, int vv, int ww): u(uu), v(vv), w(ww) {} bool operator < (const node &a) const { return w < a.w; }}edge[maxn];int Find(int x){ int r = x; while(pre[r] != r) r = pre[r]; int i = x, j; while(i != r) { j = pre[i]; pre[i] = r; i = j; } return r;}bool join(int x, int y){ int a = Find(x); int b = Find(y); if(a != b) { pre[b] = a; return true; } return false;}int main(void){ int t; cin >> t; while(t--) { k = 0; scanf("%d%d%d", &n, &m, &r); for(int i = 0; i < m+n; i++) pre[i] = i; int R = r; while(R--) { int u, v, w; scanf("%d%d%d", &u, &v, &w); v += n; w = -w; edge[k++] = node(u, v, w); } sort(edge, edge+r); int ans = (n+m)*10000, count = 0; for(int i = 0; i < r; i++) { if(join(edge[i].u, edge[i].v)) { count++; ans += edge[i].w; } if(count == n+m-1) break; } printf("%d\n", ans); } return 0;}
- poj 3723 Conscription ---最小生成树
- 【POJ】3723 Conscription 最小生成树
- poj 3723 Conscription (最小生成树)
- POJ 3723 Conscription(最小生成树)
- POJ 3723 Conscription【最小生成树】
- POJ, 3723 Conscription(最小生成树)
- POJ-3723 Conscription(最小生成树)
- poj 3723 Conscription(最小生成树)
- poj 3723 Conscription(最小生成树拓展)
- POJ 题目3723 Conscription(最小生成树变形)
- POJ 3723 Conscription(最小生成树-Kruskal)
- POJ 3723 Conscription(最小生成树--kruskul)
- POJ - 3723 Conscription(最小生成树Kruskal,思路)
- poj 3723 Conscription 【最小生成树(克鲁斯卡尔)】
- POJ 3723 Conscription(构造+最小生成树Kruskal)
- POJ 3723 Conscription(并查集+最小生成树)
- POJ 3723 Conscription (Kruskal并查集求最小生成树)
- [POJ](3723)Conscription ---- 最小生成树(Kruskal)
- 回车触发单击按钮
- MAVEN常用命令
- 面向对象(四)
- C#控制台基础 process.start指定浏览器打开指定页面
- Java中final变量的初始化方式
- poj 3723 Conscription(最小生成树)
- 云时代的分布式数据库:阿里分布式数据库服务DRDS
- 主人翁的心态,学习是长期坚持而非短期突击:jd——设计模式大赛
- Android windowIsTranslucent属性对Activity结束生命周期的影响
- 360开源的Qconf配置同步工具使用记录
- CUICatalog: Invalid asset name supplied:
- scanf,gets
- [Elasticsearch] 分布式搜索
- Java中常见几种数据库连接方法