zoukankan      html  css  js  c++  java
  • (最小生成树)Constructing Roads -- poj -- 2421

    链接:

    http://poj.org/problem?id=2421

    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 21130   Accepted: 8924

    Description

    There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected. 

    We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.

    Input

    The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j. 

    Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.

    Output

    You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.

    Sample Input

    3
    0 990 692
    990 0 179
    692 179 0
    1
    1 2
    

    Sample Output

    179

    代码:

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    
    const int N = 110;
    const int INF = 0xfffffff;
    
    int n, J[N][N], dist[N], vis[N];
    
    int Prim()
    {
        int i, j, ans=0;
        dist[1]=0;
        memset(vis, 0, sizeof(vis));
        vis[1]=1;
    
        for(i=1; i<=n; i++)
            dist[i]=J[1][i];
    
        for(i=1; i<n; i++)
        {
            int index=1, MIN=INF;
            for(j=1; j<=n; j++)
            {
                if(!vis[j] && dist[j]<MIN)
                {
                    index=j; MIN=dist[j];
                }
            }
            vis[index]=1;
            ans += MIN;
            for(j=1; j<=n; j++)
            {
                if(!vis[j] && dist[j]>J[index][j])
                    dist[j]=J[index][j];
            }
        }
        return ans;
    }
    
    int main ()
    {
        while(scanf("%d", &n)!=EOF)
        {
            int i, j;
    
            memset(J, 0, sizeof(J));
    
            for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            scanf("%d", &J[i][j]);
    
            int m, a, b;
            scanf("%d", &m);
            for(i=1; i<=m; i++)
            {
                scanf("%d%d", &a, &b);
                J[a][b]=J[b][a]=0;
            }
    
            int ans=Prim();
    
            printf("%d
    ", ans);
        }
        return 0;
    }
    勿忘初心
  • 相关阅读:
    捕获控制台输出信息
    .net 值类型变量赋值需要注意
    《河北省实施〈中华人民共和国道路交通安全法〉办法》
    在Win7应用程序中使用盾牌图标
    32位WIndows 7的“快速启动”,重启后丢失的问题,被确认是一个bug
    在本地网页中,让flash可以访问本地文件
    WPF 3D编程中,摄像机的位置很重要
    让Windows7任务栏图标显示Windows菜单(恢复,最小化,关闭)
    Joomla 书籍
    Joomla! 1.5 Template Toolbar简化Joomla模板做成的工具
  • 原文地址:https://www.cnblogs.com/YY56/p/4735045.html
Copyright © 2011-2022 走看看