結果

問題 No.2281 K → K-1 01 Flip
ユーザー heno239heno239
提出日時 2023-04-21 23:14:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 305 ms / 2,000 ms
コード長 9,287 bytes
コンパイル時間 3,301 ms
コンパイル使用メモリ 182,512 KB
実行使用メモリ 17,852 KB
最終ジャッジ日時 2024-11-06 16:38:59
合計ジャッジ時間 17,916 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
13,104 KB
testcase_01 AC 30 ms
15,652 KB
testcase_02 AC 237 ms
14,936 KB
testcase_03 AC 261 ms
17,624 KB
testcase_04 AC 65 ms
13,316 KB
testcase_05 AC 108 ms
15,916 KB
testcase_06 AC 207 ms
14,976 KB
testcase_07 AC 61 ms
17,576 KB
testcase_08 AC 162 ms
17,588 KB
testcase_09 AC 235 ms
13,888 KB
testcase_10 AC 182 ms
13,336 KB
testcase_11 AC 76 ms
14,912 KB
testcase_12 AC 65 ms
16,780 KB
testcase_13 AC 226 ms
14,128 KB
testcase_14 AC 132 ms
15,060 KB
testcase_15 AC 60 ms
13,448 KB
testcase_16 AC 243 ms
15,068 KB
testcase_17 AC 279 ms
15,932 KB
testcase_18 AC 245 ms
15,364 KB
testcase_19 AC 114 ms
16,400 KB
testcase_20 AC 71 ms
13,184 KB
testcase_21 AC 86 ms
17,300 KB
testcase_22 AC 212 ms
14,416 KB
testcase_23 AC 17 ms
12,268 KB
testcase_24 AC 123 ms
12,648 KB
testcase_25 AC 82 ms
13,332 KB
testcase_26 AC 85 ms
16,552 KB
testcase_27 AC 179 ms
17,448 KB
testcase_28 AC 81 ms
17,336 KB
testcase_29 AC 11 ms
12,692 KB
testcase_30 AC 130 ms
13,260 KB
testcase_31 AC 142 ms
15,608 KB
testcase_32 AC 206 ms
17,156 KB
testcase_33 AC 110 ms
15,396 KB
testcase_34 AC 151 ms
13,528 KB
testcase_35 AC 125 ms
17,028 KB
testcase_36 AC 175 ms
12,772 KB
testcase_37 AC 204 ms
14,904 KB
testcase_38 AC 195 ms
12,852 KB
testcase_39 AC 97 ms
14,464 KB
testcase_40 AC 40 ms
15,808 KB
testcase_41 AC 283 ms
17,456 KB
testcase_42 AC 289 ms
17,728 KB
testcase_43 AC 287 ms
17,784 KB
testcase_44 AC 305 ms
17,744 KB
testcase_45 AC 300 ms
17,852 KB
testcase_46 AC 266 ms
17,452 KB
testcase_47 AC 283 ms
17,764 KB
testcase_48 AC 278 ms
17,776 KB
testcase_49 AC 297 ms
17,660 KB
testcase_50 AC 275 ms
17,548 KB
testcase_51 AC 255 ms
17,564 KB
testcase_52 AC 244 ms
17,480 KB
testcase_53 AC 245 ms
17,428 KB
testcase_54 AC 251 ms
17,400 KB
testcase_55 AC 252 ms
17,364 KB
testcase_56 AC 244 ms
17,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

template<typename T>
struct SegT {
private:
	int sz; vector<T> node;
	T init_c;
	function<T(T, T)> f;
public:
	SegT(vector<T> v, T _init_c, function<T(T, T)> _f) {
		init_c = _init_c; f = _f;
		int n = v.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
		rep(i, n) {
			node[i + sz - 1] = v[i];
		}
		per(i, sz - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
		}
	}
	SegT(int n, T _init_c, function<T(T, T)> _f) {
		init_c = _init_c; f = _f;
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	void update(int k, T a) {
		k += sz - 1;
		node[k] = a;
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	T query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k];
		else {
			T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
	//k以上でf(x,node[y+sz-1])をtrueにするような最小のy
	int searchloc(int le, T x, function<bool(T, T)> comp) {
		int  k = le + sz - 1;
		if (comp(x, node[k]))return le;
		x = f(x, node[k]);
		while (k > 0) {
			int mem = k;
			k = (k - 1) / 2;
			if (2 * k + 1 == mem) {
				if (comp(x, node[2 * k + 2])) {
					k = 2 * k + 2; break;
				}
				x = f(x, node[2 * k + 2]);
			}
		}
		if (k == 0)return sz;
		while (k < sz - 1) {
			if (comp(x, node[2 * k + 1])) {
				k = 2 * k + 1;
			}
			else {
				x = f(x, node[2 * k + 1]);
				k = 2 * k + 2;
			}
		}
		return k - (sz - 1);
	}
};

map<pair<string, int>,int> mp;
int calc(string s, int k) {
	pair<string, int> p = { s,k };
	if (mp.find(p) != mp.end())return mp[p];
	int res = s.size();
	if (s.size() < k)return mp[p] = res;
	rep(i, s.size() - k + 1) {
		bool valid = true;
		rep(j, k - 1) {
			if (s[i + j] != s[i + j + 1])valid = false;
		}
		if (valid) {
			string ns = s;
			rep(j, k - 1) {
				ns[i + j] = '0' + '1' - s[i + j];
			}
			ns.erase(ns.begin() + i + k - 1);
			int nex = calc(ns, k);
			chmin(res, nex);
		}
	}
	return mp[p] = res;
}
void expr() {
	string z = "0000011";
	cout << calc(z, 2) << "\n";
	z = "00001111111";
	cout << calc(z, 5) << "\n";
	z = "111";
	cout << calc(z, 2) << "\n";
}
int cnt[1 << 18][2];
void solve(){
	int n, q; cin >> n >> q;
	string s; cin >> s;
	rep(i, n) {
		rep(j, 2) {
			cnt[i + 1][j] = cnt[i][j];
		}
		cnt[i + 1][s[i] - '0']++;
	}
	vector<int> vs;
	vector<int> ori(n, -mod);
	rep(i, n) {
		int le = i;
		vs.push_back(i);
		while (i + 1 < n && s[i] == s[i + 1])i++;
		ori[le] = i - le + 1;
	}
	vs.push_back(n);
	auto f = [&](int a, int b) {
		return max(a, b);
	};
	SegT<int> st(ori, -mod, f);
	rep(i, q) {
		int l, r, k; cin >> l >> r >> k; l--;
		int loc = lower_bound(all(vs), r) - vs.begin(); loc--;
		loc = vs[loc];
		st.update(loc, r - loc);
		int ma = st.query(l, r);
		st.update(loc, ori[loc]);
		loc = lower_bound(all(vs), l) - vs.begin(); loc = vs[loc];
		chmax(ma, min(loc, r) - l);
		if (ma >= k) {
			int c[2];
			rep(j, 2)c[j] = cnt[r][j] - cnt[l][j];
			//cout << "? " << c[0] << " " << c[1] << "\n";
			if (c[0] > c[1])swap(c[0], c[1]);
			int dif = c[1] - c[0];
			int dd = dif / (2 * k - 1);
			c[0] += (k - 1) * dd;
			c[1] -= k * dd;
			int ans;
			if (c[1] >= k) {
				int m = min(c[0], c[1] - k);
				c[0] -= m;
				c[1] -= m;
				while (c[0] >= k || c[1] >= k) {
					if (c[0] >= k) {
						c[0] -= k; c[1] += k - 1;
					}
					else if (c[1] >= k) {
						c[1] -= k;
						c[0] += k - 1;
					}
				}
				ans = c[0] + c[1];
			}
			else {
				ans = c[0] + c[1];
			}
			cout << ans << "\n";
		}
		else {
			cout << r - l << "\n";
		}
	}
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0