Problem p03263 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <chrono>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T> using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0),
                          std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for (int(i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for (int(i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n - 1))
#define vREP(ele, vec) for (auto &(ele) : (vec))
#define vREPcopy(ele, vec) for (auto(ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) =>
// COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A)                                              \
  (A).erase(unique((A).begin(), (A).end()), (A).end())

template <class T> inline int argmin(std::vector<T> vec) {
  return min_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline int argmax(std::vector<T> vec) {
  return max_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline void chmax(T &a, T b) {
  if (a < b)
    a = b;
}
template <class T> inline void chmin(T &a, T b) {
  if (a > b)
    a = b;
}
template <class T> inline void reverseSORT(Vec<T> &Array) {
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k) { return 1 << k; }
inline lli BitL(int k) { return 1LL << k; }
inline void putsDouble(double d) { printf("%.16lf\n", d); }
inline int toInt(const string &s) {
  int res = 0;
  for (char a : s)
    res = 10 * res + (a - '0');
  return res;
}
inline long long int toLong(const string &s) {
  lli res = 0;
  for (char a : s)
    res = 10 * res + (a - '0');
  return res;
}
template <class T> inline std::string toString(T n) {
  if (n == 0)
    return "0";
  std::string res;
  if (n < 0) {
    n = -n;
    while (n != 0) {
      res += (char)(n % 10 + '0');
      n /= 10;
    }
    std::reverse(res.begin(), res.end());
    return '-' + res;
  }
  while (n != 0) {
    res += (char)(n % 10 + '0');
    n /= 10;
  }
  std::reverse(res.begin(), res.end());
  return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

int main(void) {
  int h, w;
  scanf("%d%d", &h, &w);
  Wbool Odd(h, Vbool(w));
  REP(i, h) REP(j, w) {
    short a;
    scanf("%hd", &a);
    Odd[i][j] = (a & 1);
  }
  using information = std::tuple<int, int, int, int>;
  std::queue<information> ANS;
  REP(i, h) REP(j, w - 1) {
    if (Odd[i][j]) {
      ANS.push(make_tuple(i + 1, j + 1, i + 1, j + 2));
      Odd[i][j] = false;
      Odd[i][j + 1] = not Odd[i][j + 1];
    }
  }
  REP(i, h - 1) {
    if (Odd[i][w - 1]) {
      ANS.push(make_tuple(i + 1, w, i + 2, w));
      Odd[i][w - 1] = false;
      Odd[i + 1][h - 1] = not Odd[i + 1][w - 1];
    }
  }
  printf("%lu\n", ANS.size());
  while (not ANS.empty()) {
    int a, b, c, d;
    std::tie(a, b, c, d) = ANS.front();
    ANS.pop();
    printf("%d %d %d %d\n", a, b, c, d);
  }
  return 0;
}

Fixed submission:
#include <algorithm>
#include <chrono>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T> using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0),
                          std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for (int(i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for (int(i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n - 1))
#define vREP(ele, vec) for (auto &(ele) : (vec))
#define vREPcopy(ele, vec) for (auto(ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) =>
// COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A)                                              \
  (A).erase(unique((A).begin(), (A).end()), (A).end())

template <class T> inline int argmin(std::vector<T> vec) {
  return min_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline int argmax(std::vector<T> vec) {
  return max_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline void chmax(T &a, T b) {
  if (a < b)
    a = b;
}
template <class T> inline void chmin(T &a, T b) {
  if (a > b)
    a = b;
}
template <class T> inline void reverseSORT(Vec<T> &Array) {
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k) { return 1 << k; }
inline lli BitL(int k) { return 1LL << k; }
inline void putsDouble(double d) { printf("%.16lf\n", d); }
inline int toInt(const string &s) {
  int res = 0;
  for (char a : s)
    res = 10 * res + (a - '0');
  return res;
}
inline long long int toLong(const string &s) {
  lli res = 0;
  for (char a : s)
    res = 10 * res + (a - '0');
  return res;
}
template <class T> inline std::string toString(T n) {
  if (n == 0)
    return "0";
  std::string res;
  if (n < 0) {
    n = -n;
    while (n != 0) {
      res += (char)(n % 10 + '0');
      n /= 10;
    }
    std::reverse(res.begin(), res.end());
    return '-' + res;
  }
  while (n != 0) {
    res += (char)(n % 10 + '0');
    n /= 10;
  }
  std::reverse(res.begin(), res.end());
  return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

int main(void) {
  int h, w;
  scanf("%d%d", &h, &w);
  Wbool Odd(h, Vbool(w));
  REP(i, h) REP(j, w) {
    short a;
    scanf("%hd", &a);
    Odd[i][j] = (a & 1);
  }
  using information = std::tuple<int, int, int, int>;
  std::queue<information> ANS;
  REP(i, h) REP(j, w - 1) {
    if (Odd[i][j]) {
      ANS.push(make_tuple(i + 1, j + 1, i + 1, j + 2));
      Odd[i][j] = false;
      Odd[i][j + 1] = not Odd[i][j + 1];
    }
  }
  REP(i, h - 1) {
    if (Odd[i][w - 1]) {
      ANS.push(make_tuple(i + 1, w, i + 2, w));
      Odd[i][w - 1] = false;
      Odd[i + 1][w - 1] = not Odd[i + 1][w - 1];
    }
  }
  printf("%lu\n", ANS.size());
  while (not ANS.empty()) {
    int a, b, c, d;
    std::tie(a, b, c, d) = ANS.front();
    ANS.pop();
    printf("%d %d %d %d\n", a, b, c, d);
  }
  return 0;
}