题目:http://acm.hdu.edu.cn/showproblem.php?pid=3371
题意:有n个城市,m条边,k个城市群(已经连通),求最少花费多少使所有城市都连通。
#include <bits/stdc++.h>
#pragma GCC optimize(3)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mkp(a,b) make_pair(a,b)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define fi first
#define se second
#define lc (d<<1) //d*2
#define rc (d<<1|1) //d*2+1
#define eps 1e-9
#define dbg(x) cerr << #x << " = " << x << "\n";
#define mst(a,val) memset(a,val,sizeof(a))
#define stn(a) setprecision(a)//小数总有效位数
#define stfl setiosflags(ios::fixed)//点后位数:cout<<stfl<<stn(a);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI=3.1415926535897932;
const int MAXN=1e5+10;
const ll mod=1e9+7;
ll inline mpow(ll a,ll b){ll ans=1;a%=mod;while(b){if(b&1)ans=(ans*a)%mod;a=(a*a)%mod,b>>=1;}return ans;}
int inline sgn(double x){return (x>-eps)-(x<eps);} //a<b:sgn(a-b)<0
priority_queue<int,vector<int>,greater<int> > qu; //up
priority_queue<int,vector<int>,less<int> > qd; //dn
const int inf = 0x3f3f3f3f; //9
const ll inff = 0x3f3f3f3f3f3f3f3f; //18
//并查集
int pre[510],rnk[510];
inline void init(int n) {for(int i=0;i<=n;i++) pre[i]=i,rnk[i]=0;}
inline int find(int x)
{
int r=x,i=x,j;
while(pre[r]!=r) r=pre[r];
while(i!=r) {j=pre[i];pre[i]=r;i=j;} rnk[r]=2;
return r;
}
inline void join(int x,int y)
{
int a=find(x),b=find(y);
if(a==b) return;
if(rnk[a]<rnk[b]) pre[a]=b;
else {pre[b]=a; if(rnk[a]==rnk[b]) rnk[a]++;}
}
//kruskal
int T;
int k,p,q,c,t,a,b;
int Ver,E; //顶点数和边数 可以直接把输入的顶点数和边数的变量设为V,E 或 n,m最后赋值一下
struct Edg {int u,v,d;}edg[25010];
inline bool cmp(Edg a,Edg b) {return a.d<b.d;}
inline int kruskal()
{
sort(edg,edg+E,cmp); //edg下标是从0开始的还是1开始的
int ans=0;
for(int i=0;i<E;i++) //edg下标是从0开始的还是1开始的
{
Edg tmp=edg[i];
if(find(tmp.u)!=find(tmp.v))
{
join(tmp.u,tmp.v);
ans+=tmp.d;
}
}
return ans;
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&Ver,&E,&k);
init(Ver);
for(int i=0;i<E;i++)
{
scanf("%d%d%d",&p,&q,&c);
edg[i].u=p;edg[i].v=q;edg[i].d=c;
}
for(int i=0;i<k;i++)
{
scanf("%d%d",&t,&a);
for(int i=0;i<t-1;i++)
{
scanf("%d",&b);
join(a,b);
}
}
int ans=kruskal();
int r=find(1);
int flag=1;
for(int i=2;i<=Ver;i++)
if(find(i)!=r) {printf("-1\n");flag=0;break;} //这里不是写continue,还在for里面,得写一个flag,然后再break,否则有可能会输出两个数 -1和ans
if(flag)
printf("%d\n",ans);
}
}