zoukankan      html  css  js  c++  java
  • ACM DS Constructing Roads

    A - Constructing Roads
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    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
     
    第一次做MST,参考了一下,然后自己重新敲了一遍,理解了
     
    #include<stdio.h>
    #define MAX 1<<15
    int map[105][105];
    int lowcost[105];
    int N;
    
    
    void Prim(int N)
    {
        int i,j,k,distance = 0;
        int min;
        for(i = 2; i<=N; i++)
        {
            lowcost[i] = map[1][i];
        }
    
        for(i = 2; i<=N; i++)
        {
            min = lowcost[i];
            k=i;
            for(j=2;j<=N;j++)
            {
                if(min > lowcost[j])
                {
                    min = lowcost[j];
                    k=j;
                }
            }
    
            distance+=min;
            lowcost[k] = MAX;
    
            for(j=2; j<=N; j++)
            {
                if((map[k][j]<lowcost[j])&&(lowcost[j]<MAX))
                {
                    lowcost[j]=map[k][j];
                }
            }
        }
        printf("%d
    ",distance);
    }
    int main()
    {
    
        int n,i,j;
        while(~scanf("%d",&N))
        {
    
            for(i=1; i<=N; i++)
                for(j=1; j<=N; j++)
                    scanf("%d",&map[i][j]);
            scanf("%d",&n);
            while(n--)
            {
                scanf("%d%d",&i,&j);
                map[i][j]=map[j][i]=0;
    
            }
            Prim(N);
    
        }
        return 0;
    }
    

      

  • 相关阅读:
    团队项目 第一次作业
    20165201 课下作业第十周(选做)
    20165201 实验三敏捷开发与XP实践
    20165201 2017-2018-2 《Java程序设计》第9周学习总结
    20165201 结对编程练习_四则运算(第二周)
    20165201 2017-2018-2 《Java程序设计》第8周学习总结
    20165201 实验二面向对象程序设计
    20165326 java实验五
    20165326 课程总结
    20165326 java实验四
  • 原文地址:https://www.cnblogs.com/wejex/p/3254752.html
Copyright © 2011-2022 走看看