Submission #3099843

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int par[200001], rank_[200001];
void init(int n) {
	rep(i, n) {
		par[i] = i; rank_[i] = 0;
	}
}
int find(int x) {
	if (par[x] == x)return x;
	else return par[x] = find(par[x]);
}
void unite(int x, int y) {
	x = find(x);
	y = find(y);
	if (x == y)return;
	if (rank_[x] < rank_[y])par[x] = y;
	else {
		par[y] = x;
		if (rank_[x] == rank_[y])rank_[x]++;
	}
}
bool same(int x, int y) {
	return find(x) == find(y);
}
struct edge { int u, v; ll cost; };
bool comp(const edge&e1, const edge&e2) {
	return e1.cost < e2.cost;
}
edge es[100000];
int n, m, k; int cnt = 0;
int c[100000];
ll kruskal() {
	sort(es, es + m, comp);
	init(2*k+2);
	ll res = 0;
	rep(i, m) {
		edge e = es[i];
		if (!same(e.u,e.v)) {
			unite(e.u,e.v);
			res += e.cost;
			cnt++;
		}
		if (cnt == k - 1)break;
	}
	return res;
}
int main(){
	cin >> n>>m>>k;
	rep(i, n) {
		cin >> c[i];
	}
	rep(i, m) {
		int u, v; ll w; cin >> u >> v >> w; u--; v--;
		int c1 = c[u]; int c2 = c[v];
		if (c1 == 0)c1 = u + k + 1;
		if (c2 == 0)c2 = v + k + 1;
		es[i] = { c1,c2,w };
	}
	ll out=kruskal();
	if (cnt == k - 1)cout << out << endl;
	else cout << -1 << endl;
	return 0;
}

Submission Info

Judge Result