Problem p02721 (C++) — buggy submission, verdict: Time Limit Exceeded

/*                         _
                        _ooOoo_
                       o8888888o
                       88" . "88
                       (| -_- |)
                       O\\  =  /O
                    ____/`---'\\____
                  .'  \\\\|     |//  `.
                 /  \\\\|||  :  |||//  \\
                /  _||||| -:- |||||_  \\
                |   | \\\\\\  -  /'| |   |
                | \\_|  `\\`---'//  |_/ |
                \\  .-\\__ `-. -'__/-.  /
              ___`. .'  /--.--\\  `. .'___
           ."" '<  `.___\\_<|>_/___.' _> \\"".
          | | :  `- \\`. ;`. _/; .'/ /  .' ; |
          \\  \\ `-.   \\_\\_`. _.'_/_/  -' _.' /
===========`-.`___`-.__\\ \\___  /__.-'_.'_.-'================

                  Please give me AC.
*/

#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\\n'
#define printn(v)                                                              \\
  rep(i, (v).size() - 1) cout << (v)[i] << ' ';                                \\
  cout << (v)[n - 1] << '\\n';
#define debug(x) cerr << #x << ": " << (x) << '\\n'
#define debug2(x, y)                                                           \\
  cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\\n'
#define debug3(x, y, z)                                                        \\
  cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " \\
       << (z) << '\\n'
#define dbg(v)                                                                 \\
  for (size_t _ = 0; _ < v.size(); ++_) {                                      \\
    cerr << #v << "[" << _ << "] : " << v[_] << '\\n';                          \\
  }
// constant
const int INF = (1 << 30) - 1;
const int64 INF64 = (1LL << 62) - 1;

template <typename T> T gcd(T a, T b) {
  if (a < b)
    return gcd(b, a);
  T r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}

template <typename T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b)
    return a = b, true;
  else
    return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b)
    return a = b, true;
  else
    return false;
}

// End of template.

int dp[400200];
int cup[200200];
vector<int> ans;

int main() {
  cout << fixed << setprecision(15);
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  // cin.read(buf, sizeof buf); // 注意: ./a.out < in か pbp | ./a.out
  // で入力すること

  int n, k, c;
  string s;
  cin >> n >> k >> c >> s;

  int t = 0;

  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == 'o')
      dp[i] = t + 1;
    else
      dp[i] = -1;

    chmax(t, dp[i + c]);
  }

  // rep(i, n) cerr << dp[i] << ' '; cerr << '\\n';

  if (dp[0] > k) {
    return 0;
  }

  for (int i = n - 1; i >= 0; --i)
    cup[i] = max(cup[i + 1], dp[i]);

  for (int i = 0; i < n;) {
    if (s[i] == 'x') {
      i += 1;
      continue;
    }
    int x = dp[i];
    if (cup[i + 1] != dp[i]) {
      ans.push_back(i);
    }
    i += c + 1;
    while (i < n && dp[i] != x - 1) {
      ++i;
    }
  }

  for (const auto x : ans)
    print(x + 1);

  return 0;
}


Error: TLE

Fixed submission:

/*                         _
                        _ooOoo_
                       o8888888o
                       88" . "88
                       (| -_- |)
                       O\\  =  /O
                    ____/`---'\\____
                  .'  \\\\|     |//  `.
                 /  \\\\|||  :  |||//  \\
                /  _||||| -:- |||||_  \\
                |   | \\\\\\  -  /'| |   |
                | \\_|  `\\`---'//  |_/ |
                \\  .-\\__ `-. -'__/-.  /
              ___`. .'  /--.--\\  `. .'___
           ."" '<  `.___\\_<|>_/___.' _> \\"".
          | | :  `- \\`. ;`. _/; .'/ /  .' ; |
          \\  \\ `-.   \\_\\_`. _.'_/_/  -' _.' /
===========`-.`___`-.__\\ \\___  /__.-'_.'_.-'================

                  Please give me AC.
*/

#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\\n'
#define printn(v)                                                              \\
  rep(i, (v).size() - 1) cout << (v)[i] << ' ';                                \\
  cout << (v)[n - 1] << '\\n';
#define debug(x) cerr << #x << ": " << (x) << '\\n'
#define debug2(x, y)                                                           \\
  cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\\n'
#define debug3(x, y, z)                                                        \\
  cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " \\
       << (z) << '\\n'
#define dbg(v)                                                                 \\
  for (size_t _ = 0; _ < v.size(); ++_) {                                      \\
    cerr << #v << "[" << _ << "] : " << v[_] << '\\n';                          \\
  }
// constant
const int INF = (1 << 30) - 1;
const int64 INF64 = (1LL << 62) - 1;

template <typename T> T gcd(T a, T b) {
  if (a < b)
    return gcd(b, a);
  T r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}

template <typename T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b)
    return a = b, true;
  else
    return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b)
    return a = b, true;
  else
    return false;
}

// End of template.

int dp[400200];
int cup[200200];
vector<int> ans;

int main() {
  cout << fixed << setprecision(15);
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  // cin.read(buf, sizeof buf); // 注意: ./a.out < in か pbp | ./a.out
  // で入力すること

  int n, k, c;
  string s;
  cin >> n >> k >> c >> s;

  int t = 0;

  for (int i = n - 1; i >= 0; --i) {
    if (s[i] == 'o')
      dp[i] = t + 1;
    else
      dp[i] = -1;

    chmax(t, dp[i + c]);
  }

  // rep(i, n) cerr << dp[i] << ' '; cerr << '\\n';

  if (dp[0] > k) {
    return 0;
  }

  for (int i = n - 1; i >= 0; --i)
    cup[i] = max(cup[i + 1], dp[i]);

  for (int i = 0; i < n;) {
    if (s[i] == 'x')
      continue;
    int x = dp[i];
    if (cup[i + 1] != dp[i]) {
      ans.push_back(i);
    }
    i += c + 1;
    while (i < n && dp[i] != x - 1) {
      ++i;
    }
  }

  for (const auto x : ans)
    print(x + 1);

  return 0;
}