結果

問題 No.2281 K → K-1 01 Flip
ユーザー NyaanNyaanNyaanNyaan
提出日時 2023-05-29 15:01:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 506 ms / 2,000 ms
コード長 14,489 bytes
コンパイル時間 2,554 ms
コンパイル使用メモリ 256,008 KB
実行使用メモリ 70,656 KB
最終ジャッジ日時 2024-06-08 19:14:48
合計ジャッジ時間 24,984 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 108 ms
37,120 KB
testcase_02 AC 318 ms
36,992 KB
testcase_03 AC 389 ms
70,400 KB
testcase_04 AC 88 ms
20,096 KB
testcase_05 AC 177 ms
37,248 KB
testcase_06 AC 258 ms
36,992 KB
testcase_07 AC 181 ms
70,272 KB
testcase_08 AC 298 ms
70,400 KB
testcase_09 AC 245 ms
20,096 KB
testcase_10 AC 216 ms
20,224 KB
testcase_11 AC 126 ms
36,736 KB
testcase_12 AC 177 ms
70,272 KB
testcase_13 AC 243 ms
20,224 KB
testcase_14 AC 223 ms
37,248 KB
testcase_15 AC 61 ms
11,648 KB
testcase_16 AC 294 ms
36,864 KB
testcase_17 AC 342 ms
37,248 KB
testcase_18 AC 285 ms
36,736 KB
testcase_19 AC 239 ms
70,144 KB
testcase_20 AC 92 ms
19,968 KB
testcase_21 AC 217 ms
70,272 KB
testcase_22 AC 253 ms
20,224 KB
testcase_23 AC 16 ms
7,424 KB
testcase_24 AC 108 ms
11,648 KB
testcase_25 AC 81 ms
11,648 KB
testcase_26 AC 199 ms
70,016 KB
testcase_27 AC 300 ms
70,400 KB
testcase_28 AC 202 ms
70,144 KB
testcase_29 AC 11 ms
7,296 KB
testcase_30 AC 125 ms
11,520 KB
testcase_31 AC 224 ms
37,120 KB
testcase_32 AC 327 ms
70,272 KB
testcase_33 AC 185 ms
36,864 KB
testcase_34 AC 152 ms
11,648 KB
testcase_35 AC 260 ms
70,528 KB
testcase_36 AC 155 ms
7,296 KB
testcase_37 AC 270 ms
36,736 KB
testcase_38 AC 199 ms
11,648 KB
testcase_39 AC 127 ms
19,968 KB
testcase_40 AC 106 ms
36,992 KB
testcase_41 AC 482 ms
70,656 KB
testcase_42 AC 451 ms
70,656 KB
testcase_43 AC 452 ms
70,528 KB
testcase_44 AC 441 ms
70,656 KB
testcase_45 AC 458 ms
70,656 KB
testcase_46 AC 458 ms
70,656 KB
testcase_47 AC 446 ms
70,528 KB
testcase_48 AC 446 ms
70,656 KB
testcase_49 AC 426 ms
70,656 KB
testcase_50 AC 449 ms
70,656 KB
testcase_51 AC 444 ms
70,528 KB
testcase_52 AC 506 ms
70,656 KB
testcase_53 AC 486 ms
70,528 KB
testcase_54 AC 445 ms
70,656 KB
testcase_55 AC 448 ms
70,528 KB
testcase_56 AC 435 ms
70,528 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 * date   : 2023-05-29 15:01:26
 * author : Nyaan
 */

#define NDEBUG

using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility

namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N,F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(vector<T> &v) {
  return next_permutation(begin(v), end(v));
}

template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

}  // namespace Nyaan


// bit operation

namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan


// inout

namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan


// debug


#ifdef NyaanDebug
#define trc(...) (void(0))
#else
#define trc(...) (void(0))
#endif

#ifdef NyaanLocal
#define trc2(...) (void(0))
#else
#define trc2(...) (void(0))
#endif


// macro

#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)


namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }


//



using namespace std;

// セグ木用のモノイド(区間更新も可)
//
// sum : 全体の sum
// max, lmax, rmax : (連続部分列の要素の和)の max (空の区間を認めない)
// min, lmin, rmin : (連続部分列の要素の和)の min (空の区間を認めない)
// num : 区間の長さ
template <typename T>
struct MaxInterval {
  T sum, max, lmax, rmax, min, lmin, rmin;
  long long num;
  MaxInterval()
      : sum(0), max(0), lmax(0), rmax(0), min(0), lmin(0), rmin(0), num(0) {}
  // [x] 1 個からなる区間
  MaxInterval(T x)
      : sum(x), max(x), lmax(x), rmax(x), min(x), lmin(x), rmin(x), num(1) {}
  // [x] num 個からなる区間
  MaxInterval(T x, long long _num) {
    if (_num == 0) {
      sum = max = lmax = rmax = min = lmin = rmin = num = 0;
    } else {
      sum = x * _num;
      max = lmax = rmax = (x > 0 ? x * _num : x);
      min = lmin = rmin = (x < 0 ? x * _num : x);
      num = _num;
    }
  }
  bool operator==(const MaxInterval& rhs) const {
    return sum == rhs.sum && max == rhs.max && lmax == rhs.lmax &&
           rmax == rhs.rmax && min == rhs.min && lmin == rhs.lmin &&
           rmin == rhs.rmin && num == rhs.num;
  }
  bool operator!=(const MaxInterval& rhs) const { return !(*this == rhs); }

  // 区間のマージ
  friend MaxInterval merge(const MaxInterval& a, const MaxInterval& b) {
    if (a == MaxInterval{}) return b;
    if (b == MaxInterval{}) return a;
    MaxInterval c;
    c.sum = a.sum + b.sum;
    c.max = ::max({a.max, b.max, a.rmax + b.lmax});
    c.lmax = ::max(a.lmax, a.sum + b.lmax);
    c.rmax = ::max(b.rmax, b.sum + a.rmax);
    c.min = ::min({a.min, b.min, a.rmin + b.lmin});
    c.lmin = ::min(a.lmin, a.sum + b.lmin);
    c.rmin = ::min(b.rmin, b.sum + a.rmin);
    c.num = a.num + b.num;
    return c;
  }
};




template <typename T, typename F>
struct SegmentTree {
  int N;
  int size;
  vector<T> seg;
  const F f;
  const T I;

  SegmentTree(F _f, const T &I_) : N(0), size(0), f(_f), I(I_) {}

  SegmentTree(int _N, F _f, const T &I_) : f(_f), I(I_) { init(_N); }

  SegmentTree(const vector<T> &v, F _f, T I_) : f(_f), I(I_) {
    init(v.size());
    for (int i = 0; i < (int)v.size(); i++) {
      seg[i + size] = v[i];
    }
    build();
  }

  void init(int _N) {
    N = _N;
    size = 1;
    while (size < N) size <<= 1;
    seg.assign(2 * size, I);
  }

  void set(int k, T x) { seg[k + size] = x; }

  void build() {
    for (int k = size - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k], seg[2 * k + 1]);
    }
  }

  void update(int k, T x) {
    k += size;
    seg[k] = x;
    while (k >>= 1) {
      seg[k] = f(seg[2 * k], seg[2 * k + 1]);
    }
  }

  void add(int k, T x) {
    k += size;
    seg[k] += x;
    while (k >>= 1) {
      seg[k] = f(seg[2 * k], seg[2 * k + 1]);
    }
  }

  // query to [a, b)
  T query(int a, int b) {
    T L = I, R = I;
    for (a += size, b += size; a < b; a >>= 1, b >>= 1) {
      if (a & 1) L = f(L, seg[a++]);
      if (b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }

  T &operator[](const int &k) { return seg[k + size]; }

  // check(a[l] * ...  * a[r-1]) が true となる最大の r
  // (右端まですべて true なら N を返す)
  template <class C>
  int max_right(int l, C check) {
    assert(0 <= l && l <= N);
    assert(check(I) == true);
    if (l == N) return N;
    l += size;
    T sm = I;
    do {
      while (l % 2 == 0) l >>= 1;
      if (!check(f(sm, seg[l]))) {
        while (l < size) {
          l = (2 * l);
          if (check(f(sm, seg[l]))) {
            sm = f(sm, seg[l]);
            l++;
          }
        }
        return l - size;
      }
      sm = f(sm, seg[l]);
      l++;
    } while ((l & -l) != l);
    return N;
  }

  // check(a[l] * ... * a[r-1]) が true となる最小の l
  // (左端まで true なら 0 を返す)
  template <typename C>
  int min_left(int r, C check) {
    assert(0 <= r && r <= N);
    assert(check(I) == true);
    if (r == 0) return 0;
    r += size;
    T sm = I;
    do {
      r--;
      while (r > 1 && (r % 2)) r >>= 1;
      if (!check(f(seg[r], sm))) {
        while (r < size) {
          r = (2 * r + 1);
          if (check(f(seg[r], sm))) {
            sm = f(seg[r], sm);
            r--;
          }
        }
        return r + 1 - size;
      }
      sm = f(seg[r], sm);
    } while ((r & -r) != r);
    return 0;
  }
};


using namespace Nyaan;

void q() {
  inl(N, Q);
  ins(S);

  using D = MaxInterval<ll>;
  SegmentTree seg0(
      N, [](D& a, D& b) { return merge(a, b); }, D{});
  SegmentTree seg1(
      N, [](D& a, D& b) { return merge(a, b); }, D{});

  rep(i, N) seg0.update(i, D{S[i] == '0' ? 1 : -inf});
  rep(i, N) seg1.update(i, D{S[i] == '1' ? 1 : -inf});

  vi is1(N);
  rep(i, N) is1[i] = S[i] == '1';
  auto rui = mkrui(is1);

  rep(_, Q) {
    inl(L, R, K);
    L--;
    if (max(seg0.query(L, R).max, seg1.query(L, R).max) < K) {
      out(R - L);
      continue;
    }
    ll Y = rui[R] - rui[L];
    ll X = (R - L) - Y;
    while (1) {
      if (X > Y) swap(X, Y);
      ll mn = min(X, Y - (K - 1));
      X -= mn, Y -= mn;
      if (Y < K) break;
      ll ok = 1, ng = Y / K + 1;
      while (ok + 1 < ng) {
        ll med = (ok + ng) / 2;
        ll ny = Y - med * K;
        ll nx = X + med * (K - 1);
        (nx <= ny ? ok : ng) = med;
      }
      Y -= ok * K, X += ok * (K - 1);
    }
    out(X + Y);
  }
}

void Nyaan::solve() {
  int t = 1;
  // in(t);
  while (t--) q();
}
0