HDU 3371 Connect the Cities
题意
- 有n个城市,m条可建造道路(分别对应各自的建造费用),k 组城市相互连通。让我们判断这n个城市是不是能够连通,能就输出最少的建造费用。
思路
- Kruskal
- 我们将互相连通的点Merge起来,然后将可建造的道路按照权值排序,从小到大取,看是不是能够构成一棵树,如果不能就说明祖先结点不止一个。
(杭电交C++给我T了,然后交G++过了)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <list>
#include <map>
#define INF 0x3f3f3f3f
#define MID l + r >> 1
#define lsn rt << 1
#define rsn rt << 1 | 1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
using namespace std;
typedef long long ll;
const int maxN = 500 + 5;
int n, m, k;
int road[maxN];
int root[maxN], high[maxN], size[maxN];
int Find(int x) { return root[x] == x ? x : root[x] = Find(root[x]); }
int Same(int x, int y) { return Find(x) == Find(y); }
void Merge(int x,int y)
{
x = Find(x); y = Find(y);
if(high[x] < high[y] || size[x] < size[y])
{
root[x] = y;
size[y] += size[x];
}
else{
root[y] = x;
size[x] += size[y];
if(high[x] == high[y]) high[x] ++ ;
}
}
void init()
{
for(int i = 0 ; i <= n ; i ++)
{
root[i] = i;
high[i] = 0;
size[i] = 1;
}
}
struct node{
int u, v, w;
node(int a = 0, int b = 0, int c = 0) : u(a), v (b), w(c) {}
friend bool operator < (node n1, node n2) { return n1.w < n2.w ; }
}dot[25005];
int kruskal()
{
int ans = 0;
sort(dot + 1, dot + m + 1);
for(int i = 1 ; i <= m ; i ++ )
{
if(!Same(dot[i].u, dot[i].v))
{
Merge(dot[i].u, dot[i].v);
ans += dot[i].w;
}
}
set<int> st;
for(int i = 1 ; i <= n ; i ++ )
st.insert(Find(i));
if(st.size() > 1) return -1;
return ans;
}
int main()
{
int T; scanf("%d", &T);
while(T -- )
{
scanf("%d%d%d", &n, &m, &k);
for(int i = 1 ; i <= m ; i ++ )
scanf("%d%d%d", &dot[i].u, &dot[i].v, &dot[i].w);
init();
for(int i = 1; i <= k ; i ++ )
{
int t; scanf("%d", &t);
for(int j = 1 ; j <= t ; j ++ )
scanf("%d", &road[j]);
for(int j = 2 ; j <= t ; j ++ )
{
if(!Same(road[j-1], road[j]))
Merge(road[j - 1], road[j]);
}
}
printf("%d\n", kruskal());
}
return 0;
}