Problem p03143 (C++)

Buggy submission (status: Runtime Error):

#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b); i >= (LL)(a); i--)
#define REP(i, b) FOR(i, zero, b)
#define rep REP
#define EREP(i, b) EFOR(i, zero, b)
#define RREP(i, b) RFOR(i, b, zero)
#define ALL(c) c.begin(), c.end()
#define UNIQUE(c)                                                              \
  sort(ALL(c));                                                                \
  c.erase(unique(ALL(c)), c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a, b) OUT2(a, b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a, b) cout << (a) << " " << (b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template <typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template <typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template <typename T> inline bool middle(T a, T b, T c) {
  return b <= a && a <= c;
}
template <class T> inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T> inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<ppr, Vppr, greater<ppr>> PQ;
inline void outputVI(VI x) {
  REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }
  OUT("");
}
const int SIZE1 = 3e5 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
typedef pair<ld, ut> pld;
VI evals[SIZE];
LL maxim[SIZE];
LL anses = 0;
LL X[SIZE];
class UnionFind {

  vector<int> unions, talls, sents, dists, sizes;
  int size;

public:
  UnionFind() {}
  UnionFind(int size) : size(size) { init(); }
  void init() {
    unions = vector<int>(size);
    talls = vector<int>(size);
    sents = vector<int>(size);
    dists = vector<int>(size);
    sizes = vector<int>(size);
    FOR(i, 0, size) {
      unions[i] = i;
      sents[i] = 0;
      sizes[i] = 0;
      //			ns[i].PB(pr(0,1));
      talls[i] = 1;
    }
  }
  int find(int x, int t = 0) {
    if (unions[x] == x || sents[x] > t)
      return x;
    return find(unions[x], t);
  }
  int minisize(int x) {
    if (x == unions[x])
      return sizes[x];
    return minisize(find(x));
  }
  bool isFriend(int a, int b, int t = 0) { return find(a, t) == find(b, t); }
  void unite(int a, int b, LL y, int t = 0) {
    a = find(a, t);
    b = find(b, t);
    if (talls[a] < talls[b])
      unite(b, a, t);
    if (isFriend(a, b, t)) {
      sizes[a] += 1;
      MX(maxim[a], y);
      assert(maxim[a] <= y);
      if (maxim[a] <= X[a]) {
        assert(sizes[a] == 1);
        anses += sizes[a];
        sizes[a] = 0;
      }
      return;
    } else {

      MX(maxim[a], maxim[b]);
      // cout << maxim[a] << " " << y << endl;
      assert(maxim[a] <= y);
      MX(maxim[a], y);
      sizes[a] += sizes[b] + 1;
      sizes[b] = 0;
      X[a] += X[b];
      X[b] = 0;
      if (maxim[a] <= X[a]) {
        anses += sizes[a];
        sizes[a] = 0;
      }
      sents[b] = t;
      talls[a] = max(talls[a], talls[b] + 1);
      unions[b] = a;
      dists[b] = 1;
      //			ns[a].PB(pr(t,ns[b].back().second+ns[a].back().second));
    }
  }
};
// #define endl "\n" //インタラクティブでは消す
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
ut N, M, K, L, Q, D, H, W, R;
VI edges[SIZE];
LL vals[SIZE], answer = zero;
LL maps[SIZE2][SIZE2];
LL solve() {
  cin >> N >> M;
  EFOR(i, 1, N) cin >> X[i];
  Vppr v;
  REP(i, M) {
    LL a, b, y;
    cin >> a >> b >> y;
    v.pb(y, pr(a, b));
  }
  sort(ALL(v));
  UnionFind uf = UnionFind(N + 1);
  REP(i, v.size()) {
    LL a = v[i].second.first, b = v[i].second.second, y = v[i].first;
    uf.unite(a, b, y);
    // cout << a << " " << b << " " << anses << endl;
  }
  assert(0 <= anses and anses <= M);
  cout << M - anses << endl;
  return 0;
}

//!!!!!!!!!!!!!!!!!!!実装を詰める!!!!!!!!!!!!!!!!!!!!!!!!!
signed main() {

  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  string s;
  solve();

  // cin >> N;
  return 0;
}


Fixed submission:

#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b); i >= (LL)(a); i--)
#define REP(i, b) FOR(i, zero, b)
#define rep REP
#define EREP(i, b) EFOR(i, zero, b)
#define RREP(i, b) RFOR(i, b, zero)
#define ALL(c) c.begin(), c.end()
#define UNIQUE(c)                                                              \
  sort(ALL(c));                                                                \
  c.erase(unique(ALL(c)), c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a, b) OUT2(a, b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a, b) cout << (a) << " " << (b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template <typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template <typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template <typename T> inline bool middle(T a, T b, T c) {
  return b <= a && a <= c;
}
template <class T> inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T> inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<ppr, Vppr, greater<ppr>> PQ;
inline void outputVI(VI x) {
  REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }
  OUT("");
}
const int SIZE1 = 3e5 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p = 7 + 1e9;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
typedef pair<ld, ut> pld;
VI evals[SIZE];
LL maxim[SIZE];
LL anses = 0;
LL X[SIZE];
class UnionFind {

  vector<int> unions, talls, sents, dists, sizes;
  int size;

public:
  UnionFind() {}
  UnionFind(int size) : size(size) { init(); }
  void init() {
    unions = vector<int>(size);
    talls = vector<int>(size);
    sents = vector<int>(size);
    dists = vector<int>(size);
    sizes = vector<int>(size);
    FOR(i, 0, size) {
      unions[i] = i;
      sents[i] = 0;
      sizes[i] = 0;
      //			ns[i].PB(pr(0,1));
      talls[i] = 1;
    }
  }
  int find(int x, int t = 0) {
    if (unions[x] == x || sents[x] > t)
      return x;
    return find(unions[x], t);
  }
  int minisize(int x) {
    if (x == unions[x])
      return sizes[x];
    return minisize(find(x));
  }
  bool isFriend(int a, int b, int t = 0) { return find(a, t) == find(b, t); }
  void unite(int a, int b, LL y, int t = 0) {
    a = find(a, t);
    b = find(b, t);
    if (talls[a] < talls[b])
      unite(b, a, y, t);
    if (isFriend(a, b, t)) {
      sizes[a] += 1;
      MX(maxim[a], y);
      assert(maxim[a] <= y);
      if (maxim[a] <= X[a]) {
        assert(sizes[a] == 1);
        anses += sizes[a];
        sizes[a] = 0;
      }
      return;
    } else {

      MX(maxim[a], maxim[b]);
      // cout << maxim[a] << " " << y << endl;
      assert(maxim[a] <= y);
      MX(maxim[a], y);
      sizes[a] += sizes[b] + 1;
      sizes[b] = 0;
      X[a] += X[b];
      X[b] = 0;
      if (maxim[a] <= X[a]) {
        anses += sizes[a];
        sizes[a] = 0;
      }
      sents[b] = t;
      talls[a] = max(talls[a], talls[b] + 1);
      unions[b] = a;
      dists[b] = 1;
      //			ns[a].PB(pr(t,ns[b].back().second+ns[a].back().second));
    }
  }
};
// #define endl "\n" //インタラクティブでは消す
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
ut N, M, K, L, Q, D, H, W, R;
VI edges[SIZE];
LL vals[SIZE], answer = zero;
LL maps[SIZE2][SIZE2];
LL solve() {
  cin >> N >> M;
  EFOR(i, 1, N) cin >> X[i];
  Vppr v;
  REP(i, M) {
    LL a, b, y;
    cin >> a >> b >> y;
    v.pb(y, pr(a, b));
  }
  sort(ALL(v));
  UnionFind uf = UnionFind(N + 1);
  REP(i, v.size()) {
    LL a = v[i].second.first, b = v[i].second.second, y = v[i].first;
    uf.unite(a, b, y);
    // cout << a << " " << b << " " << anses << endl;
  }
  assert(0 <= anses and anses <= M);
  cout << M - anses << endl;
  return 0;
}

//!!!!!!!!!!!!!!!!!!!実装を詰める!!!!!!!!!!!!!!!!!!!!!!!!!
signed main() {

  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  string s;
  solve();

  // cin >> N;
  return 0;
}