zoukankan      html  css  js  c++  java
  • HDU3371--Connect the Cities

    Connect the Cities
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 6323 Accepted Submission(s): 1823


    Problem Description
    In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government wants to build some roads to connect all of these cities again, but they don’t want to take too much money.


    Input
    The first line contains the number of test cases.
    Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
    To make it easy, the cities are signed from 1 to n.
    Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
    Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.


    Output
    For each case, output the least money you need to take, if it’s impossible, just output -1.


    Sample Input
    1
    6 4 3
    1 4 2
    2 6 1
    2 3 5
    3 4 33
    2 1 2
    2 1 3
    3 4 5 6


    Sample Output
    1


    Author
    dandelion


    Source
    HDOJ Monthly Contest – 2010.04.04


    Recommend
    lcy

    kruskal超时,prim可以过

      1 #include<cstdio>
      2 #include<cmath>
      3 #include<cstring>
      4 #include<iostream>
      5 #include<algorithm>
      6 using namespace std;
      7 
      8 int n,m,k;
      9 int lowcost[501];
     10 int edge[501][501];
     11 int nearvex[501];
     12 #define INF 0xffffff
     13 
     14 void prim(int u0)
     15 {
     16     int i,j;
     17     int sumweight=0;
     18     for(i=1;i<=n;i++)
     19     {
     20         lowcost[i]=edge[u0][i];
     21         nearvex[i]=u0;
     22     }
     23     nearvex[u0]=-1;
     24     for(i=1;i<n;i++)
     25     {
     26         int v=-1;
     27         int mmin=INF;
     28         for(j=1;j<=n;j++)
     29         {
     30             if(nearvex[j]!=-1&&mmin>lowcost[j])
     31             {
     32                 mmin=lowcost[j];v=j;
     33             }
     34         }
     35         if(v!=-1)
     36         {
     37             nearvex[v]=-1;
     38             sumweight+=mmin;
     39             for(j=1;j<=n;j++)
     40             {
     41                 if(nearvex[j]!=-1&&edge[v][j]<lowcost[j])
     42                 {
     43                     lowcost[j]=edge[v][j];
     44                     nearvex[j]=v;
     45                 }
     46             }
     47         }
     48     }
     49     int sum=0;
     50     for(i=1;i<=n;i++)
     51     {
     52         if(nearvex[i]==-1)sum++;
     53     }
     54     if(sum==n)printf("%d
    ",sumweight);
     55     else
     56         printf("-1
    ");
     57 }
     58 
     59 int main()
     60 {
     61     int t;
     62     scanf("%d",&t);
     63     while(t--)
     64     {
     65         scanf("%d%d%d",&n,&m,&k);
     66         int i,j;
     67         for(i=1;i<=n;i++)
     68         {
     69             for(j=1;j<=n;j++)
     70             {
     71                 edge[i][j]=INF;
     72             }
     73         }
     74         for(i=1;i<=m;i++)
     75         {
     76             int u,v,w;
     77             scanf("%d%d%d",&u,&v,&w);
     78             if(edge[u][v]>w)
     79             {
     80                 edge[u][v]=edge[v][u]=w;
     81             }
     82         }
     83         for(i=1;i<=k;i++)
     84         {
     85             int cas;
     86             scanf("%d",&cas);
     87             int num[501];
     88             for(j=1;j<=cas;j++)
     89             {
     90                 scanf("%d",&num[j]);
     91             }
     92             for(j=1;j<=cas;j++)
     93             {
     94                 for(int p=j+1;p<=cas;p++)
     95                 {
     96                     edge[num[j]][num[p]]=edge[num[p]][num[j]]=0;
     97                 }
     98             }
     99         }
    100         int u0=1;
    101         prim(u0);
    102     }
    103     return 0;
    104 }
    View Code
  • 相关阅读:
    BZOJ 2653 middle
    BZOJ 3207 花神的嘲讽计划Ⅰ
    BZOJ 3689 异或之
    BZOJ 3037 创世纪
    BZOJ [1264] [ AHOI2006]基因匹配Match
    BZOJ 2186 [Sdoi2008]沙拉公主的困惑
    BZOJ 3362 Navigation Nightmare
    BZOJ 3209 花神的数论题
    BZOJ 1411 ZJOI2009 硬币游戏
    【HDU1573】X问题
  • 原文地址:https://www.cnblogs.com/zafuacm/p/3199718.html
Copyright © 2011-2022 走看看