zoukankan      html  css  js  c++  java
  • 【图论】POJ-3723 最大生成树

    一、题目

    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.path).

    Input

    The first line of input is the number of test case.
    The first line of each test case contains three integers, NM and R.
    Then R lines followed, each contains three integers xiyi and di.
    There is a blank line before each test case.

    1 ≤ NM ≤ 10000
    0 ≤ R ≤ 50,000
    0 ≤ xi < N
    0 ≤ yi < M
    0 < di < 10000

    Output

    For each test case output the answer in a single line.

    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
    54223
    

    二、思路&心得

    三、代码

    #include<cstdio>
    #include<algorithm>
    #define MAX_V 20005
    #define MAX_E 50005
    using namespace std;
    
    int fa[MAX_V];
    
    int N, M, R, t;
    
    struct Edge {
    	int a;
    	int b;
    	int cost;
    } E[MAX_E];
    
    bool cmp(Edge x, Edge y) {
    	return x.cost < y.cost;
    }
    
    void Union_init(int n) {
        for(int i = 0; i <= n; i ++)
        	fa[i] = i;
    }
    
    int find(int x) {
        if (fa[x] == x) return x;
        return fa[x] = find(fa[x]);
    }
    
    void Union(int x, int y) {
        x = find(x);
    	y = find(y);
        if(x != y) fa[x] = y;
    }
    
    int same(int x, int y) {
    	return find(x) == find(y);
    }
    
    int Kruscal() {
    	int x, y, sum = 0;
    	for(int i = 0; i < R; i ++) {
    		x = E[i].a, y = E[i].b;
    		x = find(x), y = find(y);
    		if( x != y ) {
    			sum += E[i].cost;
    			fa[x] = y;
    		}
    	}
    	return sum; 
    }
    
    void solve() {
    	scanf("%d %d %d", &N, &M, &R);
    	Union_init(N + M + 1);
    	for (int i = 0; i < R; i ++) {
    		scanf("%d %d %d", &E[i].a, &E[i].b, &E[i].cost);
    		E[i].b += N, E[i].cost = -E[i].cost;
    	}
    	sort(E, E + R, cmp);
    	printf("%d
    ", 10000 * (N + M) + Kruscal());
    }
    
    int main()  {
    	scanf("%d", &t);
    	while(t --) {
    		getchar();
    		solve();
    	}
    	return 0;
    }
    
  • 相关阅读:
    UI自动化实现多浏览器运行
    【转】C#操作XML方法集合
    日拱一卒
    敏捷开发- planning会议中的开会趣事
    敏捷开发- 可行走的骨骼
    敏捷开发- 测试人员何去何从
    Nunit & Specflow
    [转]根本原因分析(Root Cause Analysis)
    Selenium 中抓取dropdown
    网页模板
  • 原文地址:https://www.cnblogs.com/CSLaker/p/7281068.html
Copyright © 2011-2022 走看看