HDU3371最小生成树(kruskal)

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

坑题！卡时间！

我看了好多网上的代码有的要求G++，有的要求C++，然而我用G++和C++交都超时...

不过经过优化后的无论用什么交都可以。

优化方式看代码。

我用kruskal写的代码风格有点乱希望不影响阅读(全在主函数里实现了....)

#include<stdio.h>
#include<algorithm>
using namespace std;
int p[550];
int u[255005];
int v[255005];
int w[255005];
int r[255005];
int n,m,k;
int finds(int i)
{
    return p[i]==i?i:finds(p[i]);
}
int cmp(int a,int b)
{
    return w[a]<w[b];
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<m;i++){
            scanf("%d%d%d",&u[i],&v[i],&w[i]);
        }
        for(int i=0;i<=m;i++){
            r[i]=i;
        }
        int temp;
        int from,to;
        for(int i=0;i<=n;i++)
        p[i]=i;
        for(int i=0;i<k;i++){
            scanf("%d%d",&temp,&from);
            for(int i=1;i<temp;i++){
                scanf("%d",&to);
                int x=finds(from);
                int y=finds(to);
                if(x!=y){
                    p[y]=x;
                }
            }
        }
        int cnt=0;
        for(int i=1;i<=n;i++){
            if(p[i]!=i)
                cnt++;
        }
        int sum=0;
        sort(r,r+m,cmp);
        for(int i=0;i<m&&cnt<n-1;i++){///优化在此，如果统计边的过程中如果超过了n-1那么就不是树了，证明见离散课本。
            int e=r[i];
            int x=finds(u[e]);
            int y=finds(v[e]);
            if(x!=y){
                p[y]=x;
                cnt++;
                sum+=w[e];
                //printf("w[%d]=%d
",e,w[e]);
            }
        }
        if(cnt==n-1){
            printf("%d
",sum);
        }
        else
            printf("-1
");
    }
}