题目链接: https://ac.nowcoder.com/acm/contest/330/G
我觉得是比较复杂的BFS 这里用的是kruskal算法写的
这里并查集的话要用优化的版本,不然会超时
#include<bits/stdc++.h>
using namespace std;
struct node
{
int u,v,w;
};
node mapp[100005];
int findd[100005], bcj[100005];
bool cmp(node a, node b)
{
return a.w < b.w;
}
int DDD(int x)
{
if(bcj[x]==0) return i;
if(bcj[bcj[x]]==0) return bcj[x];
int pos = DDD(bcj[x]);
bcj[x] = pos;
return pos;
}
int main()
{
std::ios::sync_with_stdio(false);
int n, m, k, cnt, i,u,v,w, C;
long long int ans;
while(cin >> n >> m >> k)
{
memset(bcj, 0, sizeof(bcj));
C = cnt = ans = 0;
cnt = 1;
for(i = 1; i <= n; i++)
{
cin >> findd[i];
}
for(i = 0; i < m; i++)
{
node temp;
cin >> u >> v >> w;
if(findd[u]==findd[v])
continue;
temp.u = findd[u];
temp.v = findd[v];
temp.w = w;
mapp[C++] = temp;
}
sort(mapp, mapp+C, cmp);
for(i = 0; i < C; i++)
{
int x,y;
x = DDD(mapp[i].u);
y = DDD(mapp[i].v);
if(x!=y)
{
bcj[x] = y;
cnt++;
ans += mapp[i].w;
}
}
if(cnt>=k)
cout << ans << endl;
else cout << "-1" << endl;
}
return 0;
}