Problem p02852 (C++)

Buggy submission (status: Runtime Error):
// May this submission get accepted!

#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; i++)
#define RANGE(i, is, ie)                                                       \
  for (long long i = (is), i##_end = (ie); i <= i##_end; i++)
#define DSRNG(i, is, ie)                                                       \
  for (long long i = (is), i##_end = (ie); i >= i##_end; i--)
#define STEP(i, is, ie, step)                                                  \
  for (long long i = (is), i##_end = (ie), i##_step = (step); i <= i##_end;    \
       i += i##_step)
#define UNIQUE(v)                                                              \
  do {                                                                         \
    sort((v).begin(), (v).end());                                              \
    (v).erase(unique((v).begin(), (v).end()), (v).end());                      \
  } while (false)
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q)                                                                \
  cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q)                                                             \
  do {                                                                         \
    cerr << "[DEBUG] " #q ": [";                                               \
    REP(DUMPALL_ITR, (q).size()) {                                             \
      cerr << (q)[DUMPALL_ITR]                                                 \
           << (DUMPALL_ITR == DUMPALL_ITR_len - 1 ? "" : ", ");                \
    }                                                                          \
    cerr << "] at " __FILE__ ":" << __LINE__ << endl;                          \
  } while (false)
template <class T> T gcd(T a, T b) {
  if (a < b)
    std::swap(a, b);
  while (b)
    std::swap(a %= b, b);
  return a;
}
template <class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using ld = long double;
using namespace std;

// モジュール

bool found = false;

// ランレングス圧縮 O(N)
template <class RandomAccessIterator>
vector<ll> run_length(RandomAccessIterator first, RandomAccessIterator last) {
  vector<ll> rl;
  for (RandomAccessIterator itr = first; itr != last;) {
    RandomAccessIterator jtr = itr++;
    while ((itr != last && *itr == *(itr - 1)))
      itr++;
    rl.push_back(itr - jtr);
  }
  return rl;
}

void dfs(ll i, ll &n, ll &m, vector<ll> &from, string &s) {
  if (i == 0) {
    found = true;
    return;
  }
  RANGE(di, -m, -1) {
    if (i + di < 0)
      continue;
    if (s[i + di] == '0') {
      from[i + di] = i;
      dfs(i + di, n, m, from, s);
      if (found)
        return;
    }
  }
}

// 処理内容
int main() {

  // インタラクティブ問題では除去した方がいいかも
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll n, m;
  cin >> n >> m;
  string s;
  cin >> s;

  auto rl = run_length(ALL_OF(s));
  REP(i, n) {
    if (i % 2 == 0)
      continue;
    if (rl[i] >= m) {
      cout << -1 << endl;
      return 0;
    }
  }

  vector<ll> from(n + 1, -1);

  dfs(n, n, m, from, s);

  if (from[0] == -1) {
    cout << -1 << endl;
    return 0;
  }

  vector<ll> ans;
  ans.reserve(n + 1);
  ll b = 0;
  while (b < n) {
    ll pb = b;
    b = from[b];
    ans.push_back(b - pb);
  }
  REP(i, ans.size()) { cout << ans[i] << " \n"[i == i_len - 1]; }
}

Fixed submission:
// May this submission get accepted!

#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; i++)
#define RANGE(i, is, ie)                                                       \
  for (long long i = (is), i##_end = (ie); i <= i##_end; i++)
#define DSRNG(i, is, ie)                                                       \
  for (long long i = (is), i##_end = (ie); i >= i##_end; i--)
#define STEP(i, is, ie, step)                                                  \
  for (long long i = (is), i##_end = (ie), i##_step = (step); i <= i##_end;    \
       i += i##_step)
#define UNIQUE(v)                                                              \
  do {                                                                         \
    sort((v).begin(), (v).end());                                              \
    (v).erase(unique((v).begin(), (v).end()), (v).end());                      \
  } while (false)
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q)                                                                \
  cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q)                                                             \
  do {                                                                         \
    cerr << "[DEBUG] " #q ": [";                                               \
    REP(DUMPALL_ITR, (q).size()) {                                             \
      cerr << (q)[DUMPALL_ITR]                                                 \
           << (DUMPALL_ITR == DUMPALL_ITR_len - 1 ? "" : ", ");                \
    }                                                                          \
    cerr << "] at " __FILE__ ":" << __LINE__ << endl;                          \
  } while (false)
template <class T> T gcd(T a, T b) {
  if (a < b)
    std::swap(a, b);
  while (b)
    std::swap(a %= b, b);
  return a;
}
template <class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using ld = long double;
using namespace std;

// モジュール

bool found = false;

// ランレングス圧縮 O(N)
template <class RandomAccessIterator>
vector<ll> run_length(RandomAccessIterator first, RandomAccessIterator last) {
  vector<ll> rl;
  for (RandomAccessIterator itr = first; itr != last;) {
    RandomAccessIterator jtr = itr++;
    while ((itr != last && *itr == *(itr - 1)))
      itr++;
    rl.push_back(itr - jtr);
  }
  return rl;
}

void dfs(ll i, ll &n, ll &m, vector<ll> &from, string &s) {
  if (i == 0) {
    found = true;
    return;
  }
  RANGE(di, -m, -1) {
    if (i + di < 0)
      continue;
    if (s[i + di] == '0') {
      from[i + di] = i;
      dfs(i + di, n, m, from, s);
      if (found)
        return;
    }
  }
}

// 処理内容
int main() {

  // インタラクティブ問題では除去した方がいいかも
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll n, m;
  cin >> n >> m;
  string s;
  cin >> s;

  auto rl = run_length(ALL_OF(s));
  REP(i, rl.size()) {
    if (i % 2 == 0)
      continue;
    if (rl[i] >= m) {
      cout << -1 << endl;
      return 0;
    }
  }

  vector<ll> from(n + 1, -1);

  dfs(n, n, m, from, s);

  if (from[0] == -1) {
    cout << -1 << endl;
    return 0;
  }

  vector<ll> ans;
  ans.reserve(n + 1);
  ll b = 0;
  while (b < n) {
    ll pb = b;
    b = from[b];
    ans.push_back(b - pb);
  }
  REP(i, ans.size()) { cout << ans[i] << " \n"[i == i_len - 1]; }
}