zoukankan      html  css  js  c++  java
  • HDUOJ---1102Constructing Roads

    Constructing Roads

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 12173    Accepted Submission(s): 4627


    Problem 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
     

     

    Source
     

     最小生成树....

    代码:

     1 //最小生成树....
     2 //@Gxjun coder 
     3 #include<stdio.h>
     4 #include<string.h>
     5 const int inf=0x3f3f3f3f ,v=1001;
     6 int vis[v],lowc[v];
     7 int sta[v][v];
     8 int prim(int cost[][v],int n)
     9 {
    10     int i,j,p;
    11     int minc,res=0;
    12     memset(vis , 0 , sizeof(vis));
    13     vis[0]=1;
    14     for(i=1 ; i<n ;i++)
    15              lowc[i]=cost[0][i];
    16     for(i=1;i<n;i++)
    17     {
    18         minc=inf;
    19         p=-1;
    20         for(j=0 ; j<n ;j++)
    21         {
    22             if(0==vis[j] && minc>lowc[j])
    23             {
    24                 minc=lowc[j];
    25                 p=j;
    26             }
    27         }
    28         if(inf==minc) return -1; //原图不连通
    29         res+=minc ; 
    30         vis[p]=1;
    31         for(j=0; j<n ;j++)
    32         {
    33             if(0==vis[j] && lowc[j]>cost[p][j])
    34                 lowc[j]=cost[p][j];
    35         }
    36     }
    37     return res;
    38 }
    39 
    40 int main()
    41 {
    42     int tol,res,i,j;
    43     while(scanf("%d",&tol)!=EOF)
    44     {
    45         for(i=0;i<tol;i++)
    46         {
    47             for(j=0; j<tol;j++)
    48             {
    49                 scanf("%d",&sta[i][j]);
    50             }
    51         }
    52         scanf("%d",&res);
    53         int num1,num2;
    54         for(i=0;i<res;i++)
    55         {
    56             scanf("%d%d",&num1,&num2);
    57             sta[num1-1][num2-1]=sta[num2-1][num1-1]=0;
    58         }
    59         printf("%d
    ",prim(sta,tol));
    60     }
    61     return 0;
    62 } 
    View Code
  • 相关阅读:
    System.arraycopy
    关于验证控件和javaSript验证的共存问题
    正则表达式经典
    css的一些基础的东西
    运用JAVASCRIPT,写一个类,类名:student,他的属性:name,age,tall,他的方法:getName,getAge,getTall
    转: ASP.NET 应用程序生命周期概述
    转:关于 Global.asax 文件
    今天又要过去了,学习点东西!
    javaScript对象和属性
    转载:.NET 2005 实现在线人数统计
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3565186.html
Copyright © 2011-2022 走看看