Problem p01072 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai                                                               \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template <typename T> T &max(T &a, T &b) {
  if (a >= b)
    return a;
  return b;
}
template <typename T> T &min(T &a, T &b) {
  if (a < b)
    return a;
  return b;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> T get() {
  T a;
  cin >> a;
  return a;
}
template <typename T> T rev(T a) {
  reverse(all(a));
  return a;
}
template <typename T> vector<T> &sort(vector<T> &a) {
  sort(all(a));
  return a;
}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int cnt[55][55];
vpii mp[55];

signed
main() { // #define int long long
         // ?????????????????§scanf???????????¨???????????????????????\\?????????????????????
  int W, H, T;
  cin >> W >> H >> T;

  int p;
  cin >> p;

  rep(i, p) {
    int x, y, t;
    cin >> x >> y >> t;
    mp[t].PB(pii(y, x));
  }

  rep(i, H) rep(j, W) {
    int s;
    cin >> s;
    cnt[i][j] = s;
  }

  int ans = 0;

  rep(i, T) {
    rep(j, mp[i].size()) {
      pii p = mp[i][j];

      if (cnt[p.fst][p.scd]) {
        cnt[p.fst][p.scd] += 1;
      }
    }
  }
  rep(i, H) rep(j, W) if (cnt[i][j] > 0) ans += cnt[i][j] - 1;

  cout << ans << endl;
}

Error: 0

Fixed submission:

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define omajinai                                                               \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0)
#define rep(i, x) for (int i = 0; i < (int)(x); ++i)
#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template <typename T> T &max(T &a, T &b) {
  if (a >= b)
    return a;
  return b;
}
template <typename T> T &min(T &a, T &b) {
  if (a < b)
    return a;
  return b;
}
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> T get() {
  T a;
  cin >> a;
  return a;
}
template <typename T> T rev(T a) {
  reverse(all(a));
  return a;
}
template <typename T> vector<T> &sort(vector<T> &a) {
  sort(all(a));
  return a;
}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int cnt[55][55];
int a[55][55];
vpii mp[55];

signed
main() { // #define int long long
         // ?????????????????§scanf???????????¨???????????????????????\\?????????????????????
  int W, H, T;
  cin >> W >> H >> T;

  int p;
  cin >> p;

  rep(i, p) {
    int x, y, t;
    cin >> x >> y >> t;
    t--;
    mp[t].PB(pii(x, y));
  }

  rep(i, H) rep(j, W) {
    int s;
    cin >> s;
    cnt[i][j] = s;
  }

  int ans = 0;

  rep(i, T) {
    rep(j, mp[i].size()) {
      pii p = mp[i][j];
      if (cnt[p.fst][p.scd])
        cnt[p.fst][p.scd] += 1;
    }
  }

  rep(i, H) rep(j, W) if (cnt[i][j] > 0) ans += cnt[i][j] - 1;

  cout << ans << endl;
}