zoukankan      html  css  js  c++  java
  • Constructing Roads(1102 最小生成树 prim)

    Constructing Roads

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


    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
     1 #include <cstdio>
     2 #include <algorithm>
     3 #include <iostream>
     4 #include <cstring>
     5 using namespace std;
     6 #define INF 0x3f3f3f3f
     7 int map[105][105];
     8 int n,q,a,b;
     9 int res;
    10 int mincost[105];
    11 int vis[105];
    12 void prim()
    13 {
    14     mincost[1]=0;
    15     while(true)
    16     {
    17         int v=-1;
    18         int u;
    19         for(u=1;u<=n;u++)
    20         {
    21             if(!vis[u]&&(v==-1||mincost[u]<mincost[v]))
    22                 v=u;
    23         }
    24         if(v==-1)    break;
    25         vis[v]=1;
    26         res+=mincost[v];
    27         for(u=1;u<=n;u++)
    28             mincost[u]=min(map[v][u],mincost[u]);
    29     }
    30     return;
    31 }
    32 int main()
    33 {
    34     int i,j;
    35     freopen("in.txt","r",stdin);
    36     while(scanf("%d",&n)!=EOF)
    37     {
    38         res=0;
    39         fill(mincost,mincost+105,INF);
    40         memset(vis,0,sizeof(vis));
    41         for(i=1;i<=n;i++)
    42             for(j=1;j<=n;j++)
    43                 scanf("%d",&map[i][j]);
    44         scanf("%d",&q);
    45         for(i=0;i<q;i++)
    46         {
    47             scanf("%d%d",&a,&b);
    48             map[a][b]=map[b][a]=0;
    49         }
    50         prim();
    51         printf("%d
    ",res);
    52     }
    53 }
     
  • 相关阅读:
    【大白话系列】MySQL 学习总结 之 Java系统如何和 MySQL 打交道?
    【Spring Boot 源码解读】之 【为何引入了 Jedis 依赖最后用的还是 Lettuce 客户端?】
    [Python自学] PyQT5-QPushButton、QRadioButton、QCheckBox、QComboBox控件
    [Python自学] PyQT5-QLabel、QLineEdit、QTextEdit控件
    [Python自学] PyQT5-QTDesigner窗口及组成
    [Python自学] PyQT5-QTDesigner中关联信号和槽
    [Python自学] PyQT5-QTDesigner控件相关
    [Python自学] PyQT5-QTDesigner布局相关
    [Python自学] PyQT5-pycharm中配置QTDesigner扩展工具
    [音视频] 音视频基础知识
  • 原文地址:https://www.cnblogs.com/a1225234/p/5041077.html
Copyright © 2011-2022 走看看