Problem p02852 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d)                                                         \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e)                                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v)                                                         \
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \
  idp {                                                                        \
    rep(i, n) { cout << x[i] << " "; }                                         \
    puts("");                                                                  \
  }
#define dump2(x, n)                                                            \
  idp {                                                                        \
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \
    puts("");                                                                  \
  }
#define dumpi(x)                                                               \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << (*it) << " ";                                                    \
    }                                                                          \
    puts("");                                                                  \
  }
#define dumpi2(x)                                                              \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \
    }                                                                          \
    puts("");                                                                  \
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \
  rep(i, h) {                                                                  \
    rep(j, w) cout << a[i][j] << " ";                                          \
    puts("");                                                                  \
  }

// segtree ----------------------------------
// verified: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

template <typename T> class Segtree {
public:
  Segtree(li n, T default_value, T invalid_value_, std::function<T(T, T)> func_)
      : invalid_value(invalid_value_), func(func_) {
    nn = 1;
    while (nn < n) {
      nn *= 2;
    }
    data.resize(nn * 2 - 1);
    for (auto &&item : data) {
      item = default_value;
    }
  }

  inline void update(li i, T x) {
    i += nn - 1;
    data[i] = x;
    while (i > 0) {
      i = (i - 1) / 2;
      data[i] = func(data[i * 2 + 1], data[i * 2 + 2]);
    }
  }

  inline T query_(li a, li b, li k, li l, li r) {
    if (r <= a || b <= l)
      return invalid_value;
    if (a <= l && r <= b)
      return data[k];
    li mid = (l + r) / 2;
    T vl = query_(a, b, k * 2 + 1, l, mid);
    T vr = query_(a, b, k * 2 + 2, mid, r);
    return func(vl, vr);
  }

  inline T query(li a, li b) {
    li l = 0;
    li r = nn;
    li k = 0;
    if (r <= a || b <= l)
      return invalid_value;
    if (a <= l && r <= b)
      return data[k];
    li mid = (l + r) / 2;
    T vl = query_(a, b, k * 2 + 1, l, mid);
    T vr = query_(a, b, k * 2 + 2, mid, r);
    return func(vl, vr);
  }

  li nn;
  vector<T> data;
  T invalid_value;
  function<T(T, T)> func;
};
// segtree --------------------------------//

li n, m;
string s;
li prev_[100200];

int main() {
  cin >> n >> m;
  cin >> s;

  Segtree<PI> segtree(n, {bit(31) - 1, 0}, {INF, -1},
                      [](PI a, PI b) { return min(a, b); });

  segtree.update(0, {0, 0});
  rep(i, n + 1) { prev_[i] = -1; }
  repp(i, 1, n + 1) {
    if (s[i] == '1') {
      segtree.update(i, {INF, i});
      continue;
    }
    PI opt = segtree.query(max(0ll, i - m), i);
    segtree.update(i, {opt.F + 1, i});
    prev_[i] = opt.S;
  }
  vector<li> res;
  li now = n;
  while (now > 0) {
    res.pb(now);
    now = prev_[now];
  }
  if (now == -1) {
    puts("-1");
    return 0;
  }

  res.pb(0);
  reverse(allof(res));
  rep(i, sz(res) - 1) { cout << res[i + 1] - res[i] << " "; }
  cout << endl;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d)                                                         \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e)                                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \
  idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t"    \
           << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v)                                                         \
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \
  idp {                                                                        \
    rep(i, n) { cout << x[i] << " "; }                                         \
    puts("");                                                                  \
  }
#define dump2(x, n)                                                            \
  idp {                                                                        \
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \
    puts("");                                                                  \
  }
#define dumpi(x)                                                               \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << (*it) << " ";                                                    \
    }                                                                          \
    puts("");                                                                  \
  }
#define dumpi2(x)                                                              \
  idp {                                                                        \
    foreach (it, x) {                                                          \
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \
    }                                                                          \
    puts("");                                                                  \
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \
  rep(i, h) {                                                                  \
    rep(j, w) cout << a[i][j] << " ";                                          \
    puts("");                                                                  \
  }

// segtree ----------------------------------
// verified: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

template <typename T> class Segtree {
public:
  Segtree(li n, T default_value, T invalid_value_, std::function<T(T, T)> func_)
      : invalid_value(invalid_value_), func(func_) {
    nn = 1;
    while (nn < n) {
      nn *= 2;
    }
    data.resize(nn * 2 - 1);
    for (auto &&item : data) {
      item = default_value;
    }
  }

  inline void update(li i, T x) {
    i += nn - 1;
    data[i] = x;
    while (i > 0) {
      i = (i - 1) / 2;
      data[i] = func(data[i * 2 + 1], data[i * 2 + 2]);
    }
  }

  inline T query_(li a, li b, li k, li l, li r) {
    if (r <= a || b <= l)
      return invalid_value;
    if (a <= l && r <= b)
      return data[k];
    li mid = (l + r) / 2;
    T vl = query_(a, b, k * 2 + 1, l, mid);
    T vr = query_(a, b, k * 2 + 2, mid, r);
    return func(vl, vr);
  }

  inline T query(li a, li b) {
    li l = 0;
    li r = nn;
    li k = 0;
    if (r <= a || b <= l)
      return invalid_value;
    if (a <= l && r <= b)
      return data[k];
    li mid = (l + r) / 2;
    T vl = query_(a, b, k * 2 + 1, l, mid);
    T vr = query_(a, b, k * 2 + 2, mid, r);
    return func(vl, vr);
  }

  li nn;
  vector<T> data;
  T invalid_value;
  function<T(T, T)> func;
};
// segtree --------------------------------//

li n, m;
string s;
li prev_[100200];

int main() {
  cin >> n >> m;
  cin >> s;

  Segtree<PI> segtree(n + 2, {bit(31) - 1, 0}, {INF, -1},
                      [](PI a, PI b) { return min(a, b); });

  segtree.update(0, {0, 0});
  rep(i, n + 1) { prev_[i] = -1; }
  repp(i, 1, n + 1) {
    if (s[i] == '1') {
      segtree.update(i, {INF, i});
      continue;
    }
    PI opt = segtree.query(max(0ll, i - m), i);
    segtree.update(i, {opt.F + 1, i});
    prev_[i] = opt.S;
  }
  vector<li> res;
  li now = n;
  while (now > 0) {
    res.pb(now);
    now = prev_[now];
  }
  if (now == -1) {
    puts("-1");
    return 0;
  }

  res.pb(0);
  reverse(allof(res));
  rep(i, sz(res) - 1) { cout << res[i + 1] - res[i] << " "; }
  cout << endl;

  return 0;
}