提出 #41067339

---

ソースコード 拡げる

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

template<class T> inline bool chmin(T& a, T b){ if (a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if (a < b){a = b; return true;} return false;}

//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;  // mint::set_mod(p); later
//using mint = static_modint<1000000009>;

int main()
{
  cin.tie(0); cout.tie(0); ios::sync_with_stdio(false);

  ll N, M, K;
  cin >> N >> M >> K;

  string s;
  cin >> s;

  // 累積和
  vector<ll> d(N);

  int ct = 0;
  for (int i = 0; i < N; i++){
    if (s[i] == 'x') ct++;
    d[i] = ct;
  }

  // 先頭位置 l を [0, N) の範囲で動かしてニブタン
  ll ans = 0;
  for (int l = 0; l < N; l++){
    ll nl = (l == 0 ? 0 : d[l - 1]);
    ll ok = 0;
    ll ng = N * M;

    while (abs(ok - ng) > 1){
      ll mid = (ok + ng) / 2;
      ll nx = d[N-1] * (mid / N) + d[mid % N] - nl;

      if (nx <=K){ ok = mid; }
      else { ng = mid; }
    }

    chmax(ans, ok - l + 1);
  }

  cout << ans << endl;
  return 0;
}

提出情報

ジャッジ結果