Problem p03689 (C++)

Buggy submission (status: Runtime Error):
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f) { cout << (f ? "Yes" : "No") << '\n'; }

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll H, W, h, w;
  cin >> H >> W >> h >> w;
  if (H == 1 && W == 1) {
    Pr(0);
    return 0;
  }
  vll mr, mc;
  for (int p = h - 1; p < H; p += h) {
    mr.emplace_back(p);
  }
  for (int p = w - 1; p < W; p += w) {
    mc.emplace_back(p);
  }
  dump(mr);
  dump(mc);
  vvll ans(H, vll(W, 999999999 / (h * w - 1)));
  rep(i, SZ(mr)) rep(j, SZ(mc)) { ans[mr[i]][mc[j]] = -1000000000; }
  ll chk = 0;
  rep(i, H) rep(j, W) { chk += ans[i][j]; }
  vvll cs(H + 1, vll(W + 1, 0));
  rep(i, H) rep(j, W) { cs[i + 1][j + 1] = ans[i][j]; }
  rep(i, H + 1) rep(j, W) { cs[i][j + 1] += cs[i][j]; }
  rep(i, H) rep(j, W + 1) { cs[i + 1][j] += cs[i][j]; }
  rep(i, H + 1 - h) rep(j, W + 1 - w) {
    assert(cs[i][j] - cs[i + h][j] - cs[i][j + w] + cs[i + h][j + w] < 0);
  }
  if (chk <= 0) {
    Pr(0);
  } else {
    Pr(1);
    for (auto &&e : ans) {
      print(e);
    }
  }
}


Fixed submission:
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f) { cout << (f ? "Yes" : "No") << '\n'; }

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll H, W, h, w;
  cin >> H >> W >> h >> w;
  if (h == 1 && w == 1) {
    Pr(0);
    return 0;
  }
  vll mr, mc;
  for (int p = h - 1; p < H; p += h) {
    mr.emplace_back(p);
  }
  for (int p = w - 1; p < W; p += w) {
    mc.emplace_back(p);
  }
  dump(mr);
  dump(mc);
  vvll ans(H, vll(W, 999999999 / (h * w - 1)));
  rep(i, SZ(mr)) rep(j, SZ(mc)) { ans[mr[i]][mc[j]] = -1000000000; }
  ll chk = 0;
  rep(i, H) rep(j, W) { chk += ans[i][j]; }
  vvll cs(H + 1, vll(W + 1, 0));
  rep(i, H) rep(j, W) { cs[i + 1][j + 1] = ans[i][j]; }
  rep(i, H + 1) rep(j, W) { cs[i][j + 1] += cs[i][j]; }
  rep(i, H) rep(j, W + 1) { cs[i + 1][j] += cs[i][j]; }
  rep(i, H + 1 - h) rep(j, W + 1 - w) {
    assert(cs[i][j] - cs[i + h][j] - cs[i][j + w] + cs[i + h][j + w] < 0);
  }
  if (chk <= 0) {
    Pr(0);
  } else {
    Pr(1);
    for (auto &&e : ans) {
      print(e);
    }
  }
}