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

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
  cin >> N >> K;
  int C;
  cin >> C;
  string S;
  cin >> S;
  vector<int> L(K), R(K);
  int j = 0;
  rep(i, K) {
    while (S[j] == 'x')
      j++;
    L[i] = j;
    j += C + 1;
  }
  j = N - 1;
  rep(i2, K) {
    int i = K - 1 - i2;
    while (S[j] == 'x')
      j--;
    R[i] = j;
    j -= C + 1;
  }
  // cout << L << R;
  vector<int> ans;
  rep(i, K) if (L[i] == R[i]) ans.push_back(L[i] + 1);
  sort(ans.begin(), ans.end());
  rep(i, ans.size()) cout << ans[i] << endl;
  return 0;
}

Error: -6
munmap_chunk(): invalid pointer


Fixed submission:

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
  int C;
  cin >> N >> K >> C;
  string S;
  cin >> S;
  vector<int> dp(N, -1);
  rep(i, N) {
    if (S[i] == 'o') {
      if (i - C - 1 < 0)
        dp[i] = K - 1;
      else
        dp[i] = max(0LL, dp[i - C - 1] - 1);
    } else {
      if (i > 0)
        dp[i] = dp[i - 1];
    }
  }
  rep(i, N) if (S[i] == 'x') dp[i] = -1;
  int tmp = -1;
  vector<int> M(N + 1, -1);
  for (int i = N - 1; i >= 0; i--) {
    if (i >= N - 1 - C) {
      if (dp[i] != 0)
        dp[i] = -1;
    } else {
      if (M[i + C + 1] < dp[i] - 1) {
        dp[i] = -1;
      }
    }
    M[i] = max(M[i + 1], dp[i]);
  }
  for (int i = N - 1; i >= 0; i--) {
  }
  // cout << dp;
  vector<int> ans;
  vector<int> count(N + 10, 0);
  rep(i, N) { count[dp[i]]++; }
  rep(i, N) {
    if (count[dp[i]] == 1)
      ans.push_back(i + 1);
  }
  rep(i, ans.size()) cout << ans[i] << endl;

  return 0;
}