zoukankan      html  css  js  c++  java
  • (prim)hdu 1102

    Constructing Roads

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


    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
     
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<algorithm>
    #include<cmath>
    #include<cstdlib>
    using namespace std;
    #define INF 1<<30
    int n,m;
    int a[110][110],vis[110],low[110];
    int prime()
    {
          memset(vis,0,sizeof(vis));
          int minn,pos,ans=0;
          vis[1]=1,pos=1;
          for(int i=1;i<=n;i++)
          {
                if(pos!=i)
                      low[i]=a[pos][i];
          }
          for(int i=1;i<=n-1;i++)
          {
    
                minn=INF;
                for(int j=1;j<=n;j++)
                {
                      if(!vis[j]&&minn>low[j])
                      minn=low[j],pos=j;
                }
                vis[pos]=1,ans+=minn;
                for(int j=1;j<=n;j++)
                {
                      if(!vis[j]&&low[j]>a[pos][j])
                            low[j]=a[pos][j];
                }
          }
          return ans;
    }
    int main()
    {
          while(scanf("%d",&n)!=EOF)
          {
                int x,y,ans;
                for(int i=1;i<=n;i++)
                      for(int j=1;j<=n;j++)
                            scanf("%d",&a[i][j]);
                scanf("%d",&m);
                for(int i=0;i<m;i++)
                {
                      scanf("%d%d",&x,&y);
                      a[x][y]=a[y][x]=0;
                }
                ans=prime();
                printf("%d
    ",ans);
          }
          return 0;
    }
    

      

  • 相关阅读:
    android 5.1 WIFI图标上的感叹号及其解决办法
    Recovery和Charger模式下屏幕旋转180度
    Android屏幕旋转总结
    Spring MVC 数据校验@Valid
    Spring注解装配
    Spring简单的REST例子
    Spring怎么引入多个xml配置文件
    spring使用c3p0报错
    Spring+JTA+Atomikos+MyBatis分布式事务管理
    (2-3)Eureka详解
  • 原文地址:https://www.cnblogs.com/a972290869/p/4228596.html
Copyright © 2011-2022 走看看