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.
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
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 505
struct node{
int a,b,len;
}pa[26000];
struct xx
{
int x,y;
int z;
}qa[26000];
int city[N];
int d[N],groups; //groups记录这些数不同集合的数目
int find(int x)
{
while(x!=d[x])
x=d[x];
return x;
}
bool cmp(xx u,xx v)
{
return u.z<v.z;
}
void merge(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx==fy) return ;
groups--;
if(fx<fy)
d[fy]=fx;
else
d[fx]=fy;
}
int main()
{
int n,m,k,t,a,b,r,mincost;
scanf("%d",&r);
while(r--)
{
mincost=0;
scanf("%d%d%d",&n,&m,&k);
groups=n;
for(int i=1;i<=n;i++)
d[i]=i;
for(int i=1;i<=m;i++)
scanf("%d%d%d",&pa[i].a,&pa[i].b,&pa[i].len);
for(int i=1;i<=k;i++)
{
scanf("%d%d",&t,&city[1]);
for(int j=2;j<=t;j++)
{
scanf("%d",&city[j]);
merge(city[j],city[1]);
}
}
int w=1; //此时不能对数组pa[]排序 sort(pa+1,qa+m+1,cmp)
for(int i=1;i<=m;i++) //0 <= m <= 25000 m数据很大直接排序会超时
{
int f1=find(pa[i].a);
int f2=find(pa[i].b);
if(f1!=f2) //此处进行筛选,将在一个集合的数排除掉然后排序
{
qa[w].x=pa[i].a;
qa[w].y=pa[i].b;
qa[w].z=pa[i].len;
w++;
}
}
sort(qa+1,qa+w,cmp); //对筛选后的qa[]进行排序
for(int i=1;i<w;i++)
{
if(find(qa[i].x)!=find(qa[i].y))
{
mincost+=qa[i].z;
d[find(qa[i].y)]=qa[i].x;
groups--;
}
}
if(groups==1) //只有所有点连通时输出mincost
printf("%d\n",mincost);
else
printf("-1\n");
}
}