Submission #2068445

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, M, K;
int A[100000];
int U[100000], R[100000];
int find(int x) {
  if (U[x] == x) return x;
  return U[x] = find(U[x]);
}
void unite(int x, int y) {
  x = find(x), y = find(y);
  if (x == y) return;
  if (R[x] < R[y]) swap(x, y);
  U[y] = x;
  R[x] += R[y];
}
bool same(int x, int y) { return find(x) == find(y); }

vector<int> G[100000];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M >> K;
  rep(i, N) {
    cin >> A[i], A[i]--;
    if (A[i] != -1) G[A[i]].pb(i);
    U[i] = i, R[i] = 1;
  }
  rep(c, K) for (int x : G[c]) unite(x, G[c][0]);
  vector<P2> edges;
  rep(i, M) {
    int a, b, w;
    cin >> a >> b >> w;
    a--, b--;
    edges.pb(P2(w, P(a, b)));
  }
  sort(all(edges));
  long long sum = 0;
  int cnt = K-1;
  for (P2 p : edges) {
    if (cnt == 0) break;
    int w = p._1, u = p._2._1, v = p._2._2;
    if (same(u, v)) continue;
    sum += w;
    unite(u, v);
    cnt--;
  }
  if (cnt > 0) cout << -1 << "\n";
  else cout << sum << "\n";
  return 0;
}

Submission Info

Judge Result