結果

問題 No.2281 K → K-1 01 Flip
ユーザー hitonanodehitonanode
提出日時 2023-04-21 23:11:11
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 123 ms / 2,000 ms
コード長 8,483 bytes
コンパイル時間 2,605 ms
コンパイル使用メモリ 179,096 KB
実行使用メモリ 8,104 KB
最終ジャッジ日時 2024-11-06 16:36:25
合計ジャッジ時間 11,211 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 13 ms
6,820 KB
testcase_02 AC 87 ms
5,820 KB
testcase_03 AC 101 ms
7,568 KB
testcase_04 AC 25 ms
5,248 KB
testcase_05 AC 42 ms
6,228 KB
testcase_06 AC 77 ms
5,688 KB
testcase_07 AC 25 ms
7,568 KB
testcase_08 AC 62 ms
7,572 KB
testcase_09 AC 89 ms
5,248 KB
testcase_10 AC 71 ms
5,248 KB
testcase_11 AC 30 ms
5,536 KB
testcase_12 AC 26 ms
7,296 KB
testcase_13 AC 87 ms
5,248 KB
testcase_14 AC 49 ms
5,976 KB
testcase_15 AC 23 ms
5,248 KB
testcase_16 AC 90 ms
5,820 KB
testcase_17 AC 101 ms
6,104 KB
testcase_18 AC 93 ms
5,416 KB
testcase_19 AC 45 ms
7,220 KB
testcase_20 AC 28 ms
5,248 KB
testcase_21 AC 38 ms
7,336 KB
testcase_22 AC 84 ms
6,816 KB
testcase_23 AC 6 ms
6,820 KB
testcase_24 AC 50 ms
6,816 KB
testcase_25 AC 35 ms
6,820 KB
testcase_26 AC 34 ms
7,020 KB
testcase_27 AC 65 ms
7,440 KB
testcase_28 AC 32 ms
7,424 KB
testcase_29 AC 3 ms
6,820 KB
testcase_30 AC 53 ms
6,816 KB
testcase_31 AC 60 ms
6,820 KB
testcase_32 AC 80 ms
7,152 KB
testcase_33 AC 43 ms
6,820 KB
testcase_34 AC 66 ms
6,816 KB
testcase_35 AC 51 ms
7,688 KB
testcase_36 AC 77 ms
6,816 KB
testcase_37 AC 77 ms
6,820 KB
testcase_38 AC 85 ms
6,816 KB
testcase_39 AC 43 ms
6,820 KB
testcase_40 AC 16 ms
6,816 KB
testcase_41 AC 118 ms
7,852 KB
testcase_42 AC 111 ms
8,004 KB
testcase_43 AC 115 ms
7,976 KB
testcase_44 AC 109 ms
7,976 KB
testcase_45 AC 116 ms
7,976 KB
testcase_46 AC 120 ms
7,984 KB
testcase_47 AC 118 ms
7,856 KB
testcase_48 AC 119 ms
7,856 KB
testcase_49 AC 108 ms
7,852 KB
testcase_50 AC 123 ms
7,980 KB
testcase_51 AC 119 ms
7,980 KB
testcase_52 AC 117 ms
8,104 KB
testcase_53 AC 122 ms
7,976 KB
testcase_54 AC 115 ms
7,976 KB
testcase_55 AC 117 ms
7,984 KB
testcase_56 AC 118 ms
7,980 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/segtree>
int e() { return 0; }
int op(int l, int r) { return max(l, r); }

int main() {
    int N, Q;
    string S;
    cin >> N >> Q >> S;

    vector<int> suc;
    int len = 0;
    char prv = 'q';
    for (char c : S) {
        if (c == prv) {
            ++len;
        } else {
            len = 1;
        }
        prv = c;
        suc.push_back(len);
    }
    vector<int> n0(N + 1), n1(N + 1);
    REP(i, N) {
        n0.at(i + 1) = n0.at(i);
        n1.at(i + 1) = n1.at(i);
        if (S.at(i) == '0') {
            n0.at(i + 1)++;
        } else {
            n1.at(i + 1)++;
        }
    }
    dbg(make_tuple(n0, n1));

    dbg(suc);

    atcoder::segtree<int, op, e> tree(suc);

    while (Q--) {
        int l, r, k;
        cin >> l >> r >> k;
        --l;
        int hi = tree.prod(l + k - 1, r);


        if (hi >= k) {
            int n0in = n0.at(r) - n0.at(l);
            int n1in = n1.at(r) - n1.at(l);
            dbg(make_tuple(k, n0in, n1in));
            if (n0in < n1in) swap(n0in, n1in);

            const int dstep = (n0in - n1in) / (k * 2 - 1);
            n0in -= dstep * k;
            n1in += dstep * (k - 1);

            if (n0in < n1in) swap(n0in, n1in);
            dbg(make_tuple(n0in, n1in));

            int rem0 = max(0, n0in - k + 1);
            int rem1 = max(0, n1in + k - 1 - k + 1);
            chmin(rem0, rem1 + 1);
            chmin(rem1, rem0);
            dbg(make_tuple(dstep, rem0, rem1));
            cout << r - l - (dstep + rem0 + rem1) << '\n';

        } else {
            cout << r - l << '\n';
        }
    }
}
0