Problem p03128 (C++)

Buggy submission (status: Runtime Error):
#include <stdint.h>
#include <stdlib.h>

#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;

// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n)                                                                \
  for (default_counter_t i = 0, end_i = default_counter_t(n); i < end_i; ++i)
#define rep2(i, n)                                                             \
  for (default_counter_t i = 0, end_##i = default_counter_t(n); i < end_##i;   \
       ++i)
#define rep3(i, a, b)                                                          \
  for (default_counter_t i = default_counter_t(a),                             \
                         end_##i = default_counter_t(b);                       \
       i < end_##i; ++i)
#define rep4(i, a, b, c)                                                       \
  for (default_counter_t i = default_counter_t(a),                             \
                         end_##i = default_counter_t(b);                       \
       i < end_##i; i += default_counter_t(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(n)                                                               \
  for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep2(i, n)                                                            \
  for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep3(i, a, b)                                                         \
  for (default_counter_t i = default_counter_t(b) - 1,                         \
                         begin_##i = default_counter_t(a);                     \
       i >= begin_##i; --i)
#define rrep4(i, a, b, c)                                                      \
  for (default_counter_t                                                       \
           i = (default_counter_t(b) - default_counter_t(a) - 1) /             \
                   default_counter_t(c) * default_counter_t(c) +               \
               default_counter_t(a),                                           \
           begin_##i = default_counter_t(a);                                   \
       i >= begin_##i; i -= default_counter_t(c))
#define rrep(...)                                                              \
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)

#define ALL(f, c, ...)                                                         \
  (([&](decltype((c)) cccc) {                                                  \
    return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__);               \
  })(c))

// function
template <class C> constexpr C &Sort(C &a) {
  std::sort(std::begin(a), std::end(a));
  return a;
}
template <class C> constexpr auto &Min(C const &a) {
  return *std::min_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto &Max(C const &a) {
  return *std::max_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto Total(C const &c) {
  return std::accumulate(std::begin(c), std::end(c), C(0));
}
template <typename T> auto CumSum(std::vector<T> const &v) {
  std::vector<T> a(v.size() + 1, T(0));
  for (std::size_t i = 0; i < a.size() - size_t(1); ++i)
    a[i + 1] = a[i] + v[i];
  return a;
}
template <typename T> constexpr bool ChMax(T &a, T const &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> constexpr bool ChMin(T &a, T const &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

void In(void) { return; }

template <typename First, typename... Rest>
void In(First &first, Rest &...rest) {
  cin >> first;
  In(rest...);
  return;
}

template <class T, typename I> void VectorIn(vector<T> &v, const I n) {
  v.resize(size_t(n));
  rep(i, v.size()) cin >> v[i];
}

void Out(void) {
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void Out(First first, Rest... rest) {
  cout << first << " ";
  Out(rest...);
  return;
}

constexpr auto yes(const bool c) { return c ? "yes" : "no"; }
constexpr auto Yes(const bool c) { return c ? "Yes" : "No"; }
constexpr auto YES(const bool c) { return c ? "YES" : "NO"; }

// http://koturn.hatenablog.com/entry/2018/08/01/010000
template <typename T, typename U>
inline std::vector<U> MakeNdVector(T n, U val) noexcept {
  static_assert(std::is_integral<T>::value,
                "[MakeNdVector] The 1st argument must be an integer");
  return std::vector<U>(std::forward<T>(n), std::forward<U>(val));
}

template <typename T, typename... Args>
inline decltype(auto) MakeNdVector(T n, Args &&...args) noexcept {
  static_assert(std::is_integral<T>::value,
                "[MakeNdVector] The 1st argument must be an integer");
  return std::vector<decltype(MakeNdVector(std::forward<Args>(args)...))>(
      std::forward<T>(n), MakeNdVector(std::forward<Args>(args)...));
}

template <typename T, std::size_t N,
          typename std::enable_if<(N > 0), std::nullptr_t>::type = nullptr>
struct NdvectorImpl {
  using type = std::vector<typename NdvectorImpl<T, N - 1>::type>;
}; // struct ndvector_impl

template <typename T> struct NdvectorImpl<T, 1> {
  using type = std::vector<T>;
}; // struct ndvector_impl

template <typename T, std::size_t N>
using NdVector = typename NdvectorImpl<T, N>::type;

#ifdef USE_STACK_TRACE_LOGGER
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Weverything"
#include <glog/logging.h>
#pragma clang diagnostic pop
#endif //__clang__
#endif // USE_STACK_TRACE_LOGGER

signed main(int argc, char *argv[]) {
  (void)argc;
#ifdef USE_STACK_TRACE_LOGGER
  google::InitGoogleLogging(argv[0]);
  google::InstallFailureSignalHandler();
#else
  (void)argv;
#endif // USE_STACK_TRACE_LOGGER
  int64_t N, M;
  In(N, M);
  vector<int64_t> A(N);
  map<int64_t, int64_t> m;
  rep(i, M) In(A[i]);
  {
    int64_t hon[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
    rep(i, M) {
      auto it = m.find(hon[A[i]]);
      if (it != m.end()) {
        if (m[hon[A[i]]] < A[i]) {
          m[hon[A[i]]] = A[i];
        }
      } else {
        m[hon[A[i]]] = A[i];
      }
    }
  }

  auto dp = MakeNdVector(N + 1, int64_t(0));
  auto ds = MakeNdVector(N + 1, int64_t(0));
  auto from = MakeNdVector(N + 1, int64_t(0));

  rep(i, N + 1) {
    if (i > 0 && dp[i] == 0)
      continue;
    int64_t e = dp[i] + 1;
    for (const auto &v : m) {
      int64_t j = v.first;
      if (i + j > N)
        continue;
      int64_t d = v.second;
      if (dp[i + j] < e || (dp[i + j] == e && ds[i + j] < d)) {
        dp[i + j] = e;
        ds[i + j] = d;
        from[i + j] = i;
      }
    }
  }

  {
    int64_t i = N;
    while (i > 0) {
      cout << ds[i];
      i = from[i];
    }
    cout << endl;
  }

  return EXIT_SUCCESS;
}


Fixed submission:
#include <stdint.h>
#include <stdlib.h>

#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;

// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n)                                                                \
  for (default_counter_t i = 0, end_i = default_counter_t(n); i < end_i; ++i)
#define rep2(i, n)                                                             \
  for (default_counter_t i = 0, end_##i = default_counter_t(n); i < end_##i;   \
       ++i)
#define rep3(i, a, b)                                                          \
  for (default_counter_t i = default_counter_t(a),                             \
                         end_##i = default_counter_t(b);                       \
       i < end_##i; ++i)
#define rep4(i, a, b, c)                                                       \
  for (default_counter_t i = default_counter_t(a),                             \
                         end_##i = default_counter_t(b);                       \
       i < end_##i; i += default_counter_t(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(n)                                                               \
  for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep2(i, n)                                                            \
  for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep3(i, a, b)                                                         \
  for (default_counter_t i = default_counter_t(b) - 1,                         \
                         begin_##i = default_counter_t(a);                     \
       i >= begin_##i; --i)
#define rrep4(i, a, b, c)                                                      \
  for (default_counter_t                                                       \
           i = (default_counter_t(b) - default_counter_t(a) - 1) /             \
                   default_counter_t(c) * default_counter_t(c) +               \
               default_counter_t(a),                                           \
           begin_##i = default_counter_t(a);                                   \
       i >= begin_##i; i -= default_counter_t(c))
#define rrep(...)                                                              \
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)

#define ALL(f, c, ...)                                                         \
  (([&](decltype((c)) cccc) {                                                  \
    return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__);               \
  })(c))

// function
template <class C> constexpr C &Sort(C &a) {
  std::sort(std::begin(a), std::end(a));
  return a;
}
template <class C> constexpr auto &Min(C const &a) {
  return *std::min_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto &Max(C const &a) {
  return *std::max_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto Total(C const &c) {
  return std::accumulate(std::begin(c), std::end(c), C(0));
}
template <typename T> auto CumSum(std::vector<T> const &v) {
  std::vector<T> a(v.size() + 1, T(0));
  for (std::size_t i = 0; i < a.size() - size_t(1); ++i)
    a[i + 1] = a[i] + v[i];
  return a;
}
template <typename T> constexpr bool ChMax(T &a, T const &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> constexpr bool ChMin(T &a, T const &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

void In(void) { return; }

template <typename First, typename... Rest>
void In(First &first, Rest &...rest) {
  cin >> first;
  In(rest...);
  return;
}

template <class T, typename I> void VectorIn(vector<T> &v, const I n) {
  v.resize(size_t(n));
  rep(i, v.size()) cin >> v[i];
}

void Out(void) {
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void Out(First first, Rest... rest) {
  cout << first << " ";
  Out(rest...);
  return;
}

constexpr auto yes(const bool c) { return c ? "yes" : "no"; }
constexpr auto Yes(const bool c) { return c ? "Yes" : "No"; }
constexpr auto YES(const bool c) { return c ? "YES" : "NO"; }

// http://koturn.hatenablog.com/entry/2018/08/01/010000
template <typename T, typename U>
inline std::vector<U> MakeNdVector(T n, U val) noexcept {
  static_assert(std::is_integral<T>::value,
                "[MakeNdVector] The 1st argument must be an integer");
  return std::vector<U>(std::forward<T>(n), std::forward<U>(val));
}

template <typename T, typename... Args>
inline decltype(auto) MakeNdVector(T n, Args &&...args) noexcept {
  static_assert(std::is_integral<T>::value,
                "[MakeNdVector] The 1st argument must be an integer");
  return std::vector<decltype(MakeNdVector(std::forward<Args>(args)...))>(
      std::forward<T>(n), MakeNdVector(std::forward<Args>(args)...));
}

template <typename T, std::size_t N,
          typename std::enable_if<(N > 0), std::nullptr_t>::type = nullptr>
struct NdvectorImpl {
  using type = std::vector<typename NdvectorImpl<T, N - 1>::type>;
}; // struct ndvector_impl

template <typename T> struct NdvectorImpl<T, 1> {
  using type = std::vector<T>;
}; // struct ndvector_impl

template <typename T, std::size_t N>
using NdVector = typename NdvectorImpl<T, N>::type;

#ifdef USE_STACK_TRACE_LOGGER
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Weverything"
#include <glog/logging.h>
#pragma clang diagnostic pop
#endif //__clang__
#endif // USE_STACK_TRACE_LOGGER

signed main(int argc, char *argv[]) {
  (void)argc;
#ifdef USE_STACK_TRACE_LOGGER
  google::InitGoogleLogging(argv[0]);
  google::InstallFailureSignalHandler();
#else
  (void)argv;
#endif // USE_STACK_TRACE_LOGGER
  int64_t N, M;
  In(N, M);
  vector<int64_t> A(M);
  map<int64_t, int64_t> m;
  rep(i, M) In(A[i]);
  {
    int64_t hon[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
    rep(i, M) {
      auto it = m.find(hon[A[i]]);
      if (it != m.end()) {
        if (m[hon[A[i]]] < A[i]) {
          m[hon[A[i]]] = A[i];
        }
      } else {
        m[hon[A[i]]] = A[i];
      }
    }
  }

  auto dp = MakeNdVector(N + 1, int64_t(0));
  auto ds = MakeNdVector(N + 1, int64_t(0));
  auto from = MakeNdVector(N + 1, int64_t(0));

  rep(i, N + 1) {
    if (i > 0 && dp[i] == 0)
      continue;
    int64_t e = dp[i] + 1;
    for (const auto &v : m) {
      int64_t j = v.first;
      if (i + j > N)
        continue;
      int64_t d = v.second;
      if (dp[i + j] < e || (dp[i + j] == e && ds[i + j] < d)) {
        dp[i + j] = e;
        ds[i + j] = d;
        from[i + j] = i;
      }
    }
  }

  {
    int64_t i = N;
    while (i > 0) {
      cout << ds[i];
      i = from[i];
    }
    cout << endl;
  }

  return EXIT_SUCCESS;
}