zoukankan      html  css  js  c++  java
  • hdu3371

    Connect the Cities

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 7269    Accepted Submission(s): 2076


    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
     
    方法一:kruskal算法

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    int father[100000],n,m,k,sum,rank[100000];
    struct edg
    {
        int start,end,money;
    } e[100000];
    bool cmp(edg a,edg b)
    {
        return a.money<b.money;
    }
    void makeset(int x)
    {
        int i;
        for(i=1; i<=x; i++)
        {
            father[i]=i;
            rank[i]=1;
        }
    }
    int find(int x)
    {
        return x==father[x]?x:father[x]=find(father[x]);
    }
    void uon(int x,int y)
    {
        x=find(x);
        y=find(y);
        if(x!=y)
        {
            if(rank[x]>=rank[y])
            {
                father[y]=x;
                rank[x]+=rank[y];
                rank[y]=0;
            }
            else
            {
                father[x]=y;
                rank[y]+=rank[x];
                rank[x]=0;
            }
        }
    }

    int main()
    {
        int N,i,t,a[100000],j,len;
        scanf("%d",&N);
        while(N--)
        {
            scanf("%d%d%d",&n,&m,&k);
            makeset(n);
            for(i=1; i<=m; i++)
            {
                scanf("%d%d%d",&e[i].start,&e[i].end,&e[i].money);
            }
            for(i=1; i<=k; i++)
            {
                scanf("%d",&t);
                scanf("%d",&a[1]);
                for(j=2; j<=t; j++)
                {
                    scanf("%d",&a[j]);
                    uon(a[j-1],a[j]);
                }
            }
            sort(e+1,e+m+1,cmp);
            sum=len=0;
            for(i=1; i<=m; i++)
            {
                if(find(e[i].start)!=find(e[i].end))
                {
                    uon(e[i].start,e[i].end);
                    sum+=e[i].money;
                }
            }
            for(i=1; i<=n; i++)
            {
                if(rank[i]>0)
                    len++;
            }
            if(len==1)
                printf("%d ",sum);
            else
                printf("-1 ");
        }
    }

    方法二:prime算法

    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    #include <cmath>
    #define N 503
    using namespace std;
    int map[N][N];
    bool visit[N];
    int n;
    void prim()
    {
        memset(visit,0,sizeof(visit));
        visit[1]=1;
        int i,j,t=n,min,sum=0;
        while(--t)
        {
            min=1000;
            for(i=2; i<=n; i++)
                if(!visit[i]&&map[1][i]<min)
                    min=map[1][i],j=i;
            if(min==1000)
            break;
            visit[j]=1;
            sum+=min;
            for(i=2; i<=n; i++)
                if(!visit[i]&&map[1][i]>map[j][i])
                    map[1][i]=map[j][i];
        }
        if(min==1000)
            printf("-1 ");
        else
            printf("%d ",sum);
    }
    int main()
    {
        int m,l,k,t,T,i,j;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d%d%d",&n,&m,&l);
            for(i=1; i<=n; i++)
                for(j=1; j<=n; j++)
                    map[i][j]=1000;
            while(m--)
            {
                scanf("%d%d%d",&i,&j,&k);
                map[i][j]=map[i][j]>k?k:map[i][j];
                map[j][i]=map[i][j];
            }
            while(l--)
            {
                scanf("%d%d",&t,&i);
                while(--t)
                {
                    scanf("%d",&j);
                    map[i][j]=map[j][i]=0;
                    i=j;
                }
            }
            prim();
        }
        return 0;
    }

  • 相关阅读:
    SQL查询,所有的客户订单日期最新的前五条订单记录。
    session的原理
    @RequestMapping 注解用在类上面有什么作用?
    事务的概念,在JDBC编程中处理事务的步骤
    .Redis优势
    Spring框架中都用到了哪些设计模式?
    redis
    你为什么觉得自己能够在这个职位上取得成就?
    怎样理解团队?请举例并说明启示。
    物质待遇和工作条件是人们选择工作的重要因素之一,这次报考谈一谈你在选择工作时都考虑哪些因素?为什么?
  • 原文地址:https://www.cnblogs.com/lxm940130740/p/3289705.html
Copyright © 2011-2022 走看看