zoukankan      html  css  js  c++  java
  • ACM POJ 2421 Constructing Roads(简单最小生成树)

    Constructing Roads
    Time Limit: 2000MS Memory Limit: 65536K
    Total Submissions: 14128 Accepted: 5682

    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<stdio.h>
    #include
    <string.h>
    #define MAXN 210
    int cost[MAXN][MAXN];
    const int INF=0x3f3f3f3f;
    int vis[MAXN];
    int lowc[MAXN];
    int prim(int cost[][MAXN],int n)//编号从1-n
    {
    int i,j,p;
    int minc,res=0;
    memset(vis,
    0,sizeof(vis));
    vis[
    1]=1;
    for(i=1;i<=n;i++)
    lowc[i]
    =cost[1][i];
    for(i=1;i<n;i++)
    {
    minc
    =INF;
    p
    =-1;
    for(j=1;j<=n;j++)
    if(vis[j]==0&&minc>lowc[j])
    {minc
    =lowc[j];p=j;}
    if(minc==INF)return -1;
    res
    +=minc;vis[p]=1;
    for(j=1;j<=n;j++)
    if(vis[j]==0&&lowc[j]>cost[p][j])
    lowc[j]
    =cost[p][j];
    }
    return res;
    }
    int main()
    {
    int n,i,j;
    int m,a,b;
    while(scanf("%d",&n)!=EOF)
    {
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    scanf(
    "%d",&cost[i][j]);
    scanf(
    "%d",&m);
    for(i=1;i<=m;i++)
    {
    scanf(
    "%d%d",&a,&b);
    cost[a][b]
    =0;
    cost[b][a]
    =0;
    }
    printf(
    "%d\n",prim(cost,n));
    }
    return 0;
    }

  • 相关阅读:
    如何用Spring Security OAuth2 实现登录互踢,面试必学
    你确定Java注释不会被执行吗?80%的人都不知道
    常见Java性能问题一招帮你解决,80%的人都不知道
    Spring中的反射与反射的原理,案例详解
    10大Java方向最热门的开源项目,高薪必学
    2020最新Python学习常见十大问题总结
    Java源码系列-LinkedHashMap,高薪面试必学
    Java8的Lambda表达式你了解吗?80%的都不知道
    分块矩阵
    矩阵--逆矩阵和伴随矩阵
  • 原文地址:https://www.cnblogs.com/kuangbin/p/2129627.html
Copyright © 2011-2022 走看看