HDU - 3371 Connect the Cities

HDU - 3371 Connect the Cities

原题链接到HDU：http://acm.hdu.edu.cn/showproblem.php?pid=3371

---

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

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 | We have carefully selected several similar problems for you: 1233 1875 1301 1879 1162

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>>
#include <vector>
using namespace std;
struct Edge{
    int l,r;
    int sp;
};
vector<Edge>edgelist;
set<int>myset;
int f[510],cnt,number,ans;
bool cmp(Edge x,Edge y)
{
    return x.sp<y.sp;
}
int Find(int x)
{
    if(x!=f[x])f[x]=Find(f[x]);
    return f[x];
}
int nextInt(){
    char ch = getchar();
    int ret = 0;
    while(ch < '0'||ch > '9')
        ch = getchar();
    do{
        ret = ret*10+ch-'0';
        ch = getchar();
    }while(ch>='0'&&ch<='9');
    return ret;
}
bool Union(int x,int y,int i)
{
    int u=Find(x);
    int v=Find(y);
    //cout<<u<<" "<<v<<endl;
    if(u!=v)
    {
        f[u]=v;
        ans+=edgelist[i].sp;
        cnt++;
        //cout<<ans<<endl;
        if(cnt==number)return true;
        else return false;
    }
    return false;
}

int main()
{
    int T,n,m,k;
    T=nextInt();
    while(T--)
    {
        edgelist.clear();
        myset.clear();
        n=nextInt();
        m=nextInt();
        k=nextInt();
        for(int i=0;i<=n;i++) f[i]=i;
        for(int i=1;i<=m;i++)
        {
            Edge temp;
            temp.l=nextInt();
            temp.r=nextInt();
            temp.sp=nextInt();
            edgelist.push_back(temp);
        }
        for(int i=1;i<=k;i++)
        {
            int t,city;
            t=nextInt();
            city=nextInt();
            int fcity=Find(city);
            for(int j=1;j<t;j++)
            {
                int temp;
                temp =nextInt();
                f[Find(temp)]=fcity;
            }
        }
        sort(edgelist.begin(),edgelist.end(),cmp);

        for(int i=1;i<=n;i++) myset.insert(Find(i));
        number = myset.size()-1;
        cnt=0,ans=0;
        for(int i=0;i<edgelist.size();i++)
        {
            //cout<<<<endl;

            if(Union(edgelist[i].l,edgelist[i].r,i))break;
        //if(i==0){
                //<<ans<<" "<<edgelist[i].sp<<endl;
            //}
        }
        //cout<<ans<<endl;
        bool ok=true;
        int root = Find(1);
        for(int i=2;i<=n;i++)
        {
            if(Find(i)!=root){
                ok = false;
                break;
            }
        }
        if(ok) printf("%d\n",ans);
        else printf("-1\n");
    }

    return 0;
}

... prompt'''

一道卡超时的题目反反复复做了三四次才意识到可能要用到快速输入模板可是用了之后还是会发生怪事

一模一样 的代码在vjudge上永远过不了而在HUD上可以看人品AC。。。