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

#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;

#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost;
using ml = multiprecision::cpp_int;
using md = multiprecision::cpp_dec_float_100;
#endif

/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x)                                                              \\
  do {                                                                         \\
    cout << x << endl;                                                         \\
    exit(0);                                                                   \\
  } while (0)
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...)                                                           \\
  if (ll i = -1)                                                               \\
    for (__VA_ARGS__)                                                          \\
      if (i++, 1)
#define each(i, e, c) fori(i, auto &&e : c) // for each
/***** const value *****/
#define llong_max 9223372036854775807 // 9 * 10^18
#define ldbl_max 1.79769e+308         // 1.7 * 10^308
#define pi 3.1415926535897932         // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
    (auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
    (auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
    (auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
    (auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
    (auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
    (auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
    (auto n) { return (ll)pow(10, n); };
auto Size = [] // long long collection size
    (auto &c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
    (auto b, auto e) { return accumulate(b, e, 0LL); };

/***** operator *****/
template <class T, class S>
pair<T, S> operator+(pair<T, S> l, pair<T, S> r) { // pair<T, S> + pair<T, S>
  return {l.first + r.first, l.second + r.second};
}
template <class T, class S>
pair<T, S> operator-(pair<T, S> l, pair<T, S> r) { // pair<T, S> - pair<T, S>
  return {l.first - r.first, l.second - r.second};
}

/***** template *****/
template <class T>
void MakeVVT(ll ys, ll xs, vvt<T> &v,
             T fill = T()) { // vector<vector<T>> resize + fill
  v.resize(ys);
  rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T>
void MakeVVVT(ll zs, ll ys, ll xs, vvvt<T> &v,
              T fill = T()) { // vector<vector<vector<T>>> resize + fill
  v.resize(zs);
  rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T>
void InputVVT(ll ys, ll xs, vvt<T> &v,
              T fix = T()) { // input vector<vector<T>> (T != struct) + fix
  MakeVVT(ys, xs, v, fix);
  rep(y, 0, ys) rep(x, 0, xs) {
    cin >> v[y][x];
    v[y][x] += fix;
  }
}
template <class T>
void InputVVVT(
    ll zs, ll ys, ll xs, vvvt<T> &v,
    T fix = T()) { // input vector<vector<vector<T>>> (T != struct) + fix
  v.resize(zs);
  rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget {
/***** 数列列挙ライブラリ *****/

struct NT_NyaaNumberEnumeration { // 結果を格納する変数
  std::vector<long long> test;
  std::vector<std::vector<long long>> res;

  /**
   * @brief 数列列挙の実行
   * @param range 各桁の数値範囲
   * @param size 最大の桁数
   * @note
   * DFSで各桁が[range.first, range.second]を満たすsize桁の数列を全て列挙する。
   **/
  decltype(res) &Run(std::pair<long long, long long> range, long long size) {
    if ((long long)test.size() == size) {
      res.push_back(test);
      return res;
    }

    auto b = test.empty() ? range.first : test.back();
    for (auto x = b; x <= range.second; x++) { // pop_backは必須
      test.push_back(x);
      Run(range, size);
      test.pop_back();
    }

    return res;
  }
};
} // namespace NyaGadget

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
// using mll = NT_ModLL< 1000000007 >;
// using mll = ModLL< 998244353 >;

struct Nyaa {
  ll a = 0;
  ll b = 0;
  ll c = 0;
  ll d = 0;
};

int main(void) {
  ll N, M, Q;
  cin >> N >> M >> Q;
  vt<Nyaa> nyaa(Q);
  each(i, e, nyaa) {
    cin >> e.a >> e.b >> e.c >> e.d;
    e.a--, e.b--;
  }

  ll ans = 0;
  NT_NyaaNumberEnumeration nne;
  auto res = nne.Run({1, M}, N);

  rep(i, 0, Size(res)) {
    ll sum = 0;
    each(j, e, nyaa) if (res[i][e.b] - res[i][e.a] == e.c) sum += e.d;
    ans = max(ans, sum);
  }
  cout << ans;

  return 0;
}

Error: -11

Fixed submission:

#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;

#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost;
using ml = multiprecision::cpp_int;
using md = multiprecision::cpp_dec_float_100;
#endif

/***** type *****/
using ll = long long;
using ld = long double;
using pll = pair<long long, long long>;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout double
#define output(x)                                                              \\
  do {                                                                         \\
    cout << x << endl;                                                         \\
    exit(0);                                                                   \\
  } while (0)
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define fori(i, ...)                                                           \\
  if (ll i = -1)                                                               \\
    for (__VA_ARGS__)                                                          \\
      if (i++, 1)
#define each(i, e, c) fori(i, auto &&e : c) // for each
/***** const value *****/
#define llong_max 9223372036854775807 // 9 * 10^18
#define ldbl_max 1.79769e+308         // 1.7 * 10^308
#define pi 3.1415926535897932         // 3.14 ...
/***** lambda *****/
auto Ceil = [] // if (a % b != 0) return a / b + 1;
    (auto x) { return (ll)ceil(x); };
auto Count = [] // long long count value
    (auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoL = [] // char to number
    (auto c) { return (ll)c - (ll)'0'; };
auto LtoC = [] // number to char
    (auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
    (auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
    (auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
    (auto n) { return (ll)pow(10, n); };
auto Size = [] // long long collection size
    (auto &c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
    (auto b, auto e) { return accumulate(b, e, 0LL); };

/***** operator *****/
template <class T, class S>
pair<T, S> operator+(pair<T, S> l, pair<T, S> r) { // pair<T, S> + pair<T, S>
  return {l.first + r.first, l.second + r.second};
}
template <class T, class S>
pair<T, S> operator-(pair<T, S> l, pair<T, S> r) { // pair<T, S> - pair<T, S>
  return {l.first - r.first, l.second - r.second};
}

/***** template *****/
template <class T>
void MakeVVT(ll ys, ll xs, vvt<T> &v,
             T fill = T()) { // vector<vector<T>> resize + fill
  v.resize(ys);
  rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T>
void MakeVVVT(ll zs, ll ys, ll xs, vvvt<T> &v,
              T fill = T()) { // vector<vector<vector<T>>> resize + fill
  v.resize(zs);
  rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T>
void InputVVT(ll ys, ll xs, vvt<T> &v,
              T fix = T()) { // input vector<vector<T>> (T != struct) + fix
  MakeVVT(ys, xs, v, fix);
  rep(y, 0, ys) rep(x, 0, xs) {
    cin >> v[y][x];
    v[y][x] += fix;
  }
}
template <class T>
void InputVVVT(
    ll zs, ll ys, ll xs, vvvt<T> &v,
    T fix = T()) { // input vector<vector<vector<T>>> (T != struct) + fix
  v.resize(zs);
  rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget {
/***** 数列列挙ライブラリ *****/

struct NT_NyaaNumberEnumeration { // 結果を格納する変数
  std::vector<long long> test;
  std::vector<std::vector<long long>> res;

  /**
   * @brief 数列列挙の実行
   * @param range 各桁の数値範囲
   * @param size 最大の桁数
   * @note
   * DFSで各桁が[range.first, range.second]を満たすsize桁の数列を全て列挙する。
   **/
  decltype(res) &Run(std::pair<long long, long long> range, long long size) {
    if ((long long)test.size() == size) {
      res.push_back(test);
      return res;
    }

    long long begin = test.empty() ? range.first : test.back();
    for (long long v = begin; v <= range.second; ++v) { // pop_backは必須
      test.push_back(v);
      Run(range, size);
      test.pop_back();
    }
  }
};
} // namespace NyaGadget

/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
// using mll = NT_ModLL< 1000000007 >;
// using mll = ModLL< 998244353 >;

struct Nyaa {
  ll a = 0;
  ll b = 0;
  ll c = 0;
  ll d = 0;
};

int main(void) {
  ll N, M, Q;
  cin >> N >> M >> Q;
  vt<Nyaa> nyaa(Q);
  each(i, e, nyaa) {
    cin >> e.a >> e.b >> e.c >> e.d;
    e.a--, e.b--;
  }

  ll ans = 0;
  NT_NyaaNumberEnumeration nne;
  auto res = nne.Run({1, M}, N);
  rep(i, 0, Size(res)) {
    ll sum = 0;
    each(j, e, nyaa) if (res[i][e.b] - res[i][e.a] == e.c) sum += e.d;
    ans = max(ans, sum);
  }
  cout << ans;

  return 0;
}