// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
GOAT
----------------------------------------------------------------
*/
struct Query {
str type;
int i, a, b;
Query() {}
};
const int N = 3e5 + 5;
int n, q;
char s[N];
Query query[N];
void input(int test_id) {
cin >> n >> q;
FOR(i, 1, n) cin >> s[i];
FOR(i, 1, q) {
cin >> query[i].type;
if (query[i].type == "toggle") cin >> query[i].i;
else {
cin >> query[i].a >> query[i].b;
--query[i].b;
}
}
}
namespace subtask1 {
vector<str> versions;
bool check_valid() {
if (n <= 100 && q <= 100) return 1;
return 0;
}
bool check(str &s, int l, int r) {
str tmp = s.substr(l - 1, r - l + 1);
EACH(i, tmp)
if (i != '1')
return 0;
return 1;
}
void solve() {
str s1(n, '0');
FOR(i, 1, n) s1[i - 1] = s[i];
versions.pb(s1);
FOR(j, 1, q) {
str tmp = versions.bk();
if (query[j].type == "toggle") {
int i = query[j].i;
tmp[i - 1] = 1 - tmp[i - 1] + 2 * '0';
}
if (query[j].type == "query") {
int a = query[j].a, b = query[j].b, rs = 0;
EACH(hour, versions)
if (check(hour, a, b))
++rs;
cout << rs << '\n';
}
versions.pb(tmp);
}
}
}
namespace subtask2 {
int f[N], d[N];
bool check_valid() {
FOR(i, 1, q)
if (query[i].type == "query" && query[i].b - query[i].a != 0)
return 0;
return 1;
}
void solve() {
FOR(j, 1, q)
if (query[j].type == "toggle") {
int i = query[j].i;
s[i] = 1 - s[i] + 2 * '0';
if (s[i] == '0') f[i] += j - d[i];
d[i] = j;
}
else {
int a = query[j].a, rs = f[a];
if (s[a] == '1') rs += j - d[a];
cout << rs << '\n';
}
}
}
namespace subtask3 {
int l[N], r[N], ans[N], f[N];
vi d[N];
void upd(int pos, int v) { for (int i = pos; i <= n; i += (i & -i)) f[i] += v; }
int get(int pos) { int rs = 0; for (int i = pos; i > 0; i -= (i & -i)) rs += f[i]; return rs; }
bool check_valid() {
bool ok = 1;
FOR(j, 1, q) {
if (query[j].type != "toggle") continue;
int i = query[j].i;
if (s[i] == '0') ok = 0;
s[i] ^= 1;
}
assert(ok);
FOR(j, 1, q) {
if (query[j].type != "toggle") continue;
int i = query[j].i;
s[i] ^= 1;
}
return ok;
}
void solve() {
FOR(j, 1, q)
if (query[j].type == "query") {
l[j] = 1;
r[j] = j;
}
else l[j] = r[j] + 1;
FRN(iterated, 19) {
memset(f, 0, sizeof f);
FOR(i, 1, n) upd(i, s[i] - '0');
FOR(i, 1, q)
if (l[i] <= r[i]) {
int mid = l[i] + (r[i] - l[i]) / 2;
d[mid].pb(i);
}
FOR(j, 1, q) {
EACH(i, d[j]) {
int a = query[i].a, b = query[i].b;
if (get(b) - get(a - 1) == b - a + 1) {
ans[i] = j;
l[i] = j + 1;
}
else r[i] = j - 1;
}
d[j].clear();
if (query[j].type == "toggle") {
int i = query[j].i, prev = s[i] - '0', newv = !prev;
upd(i, newv - prev);
s[i] ^= 1;
}
}
FOR(j, 1, q)
if (query[j].type == "toggle")
s[query[j].i] ^= 1;
}
FOR(j, 1, q)
if (query[j].type == "query")
cout << ans[j] << '\n';
}
}
void solve(int test_id) {
if (subtask1::check_valid()) {
subtask1::solve();
return;
}
if (subtask2::check_valid()) {
subtask2::solve();
return;
}
if (subtask3::check_valid()) {
subtask3::solve();
return;
}
}
void reinit(int test_id) {
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
int test_num = 1;
// cin >> test_num; // comment if the problem does not requires multitest
FOR(i, 1, test_num) {
input(i); // input in noninteractive problems for case #i
solve(i); // main function to solve case #i
reinit(i); // reinit global data to default used in case #i
}
#ifdef LOCAL
cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
#endif
return 0;
}
/*
5 5
11111
query 1 5
toggle 1
query 2 5
toggle 5
query 1 5
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
21460 KB |
Output is correct |
| 2 |
Correct |
11 ms |
21428 KB |
Output is correct |
| 3 |
Correct |
11 ms |
21460 KB |
Output is correct |
| 4 |
Correct |
10 ms |
21484 KB |
Output is correct |
| 5 |
Correct |
11 ms |
21460 KB |
Output is correct |
| 6 |
Correct |
11 ms |
21440 KB |
Output is correct |
| 7 |
Correct |
11 ms |
21388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
83 ms |
22360 KB |
Output is correct |
| 2 |
Correct |
81 ms |
22288 KB |
Output is correct |
| 3 |
Correct |
85 ms |
22364 KB |
Output is correct |
| 4 |
Correct |
117 ms |
24700 KB |
Output is correct |
| 5 |
Correct |
95 ms |
23920 KB |
Output is correct |
| 6 |
Correct |
84 ms |
24700 KB |
Output is correct |
| 7 |
Correct |
100 ms |
22260 KB |
Output is correct |
| 8 |
Correct |
107 ms |
23628 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
26 ms |
43380 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
28 ms |
43348 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
21460 KB |
Output is correct |
| 2 |
Correct |
11 ms |
21428 KB |
Output is correct |
| 3 |
Correct |
11 ms |
21460 KB |
Output is correct |
| 4 |
Correct |
10 ms |
21484 KB |
Output is correct |
| 5 |
Correct |
11 ms |
21460 KB |
Output is correct |
| 6 |
Correct |
11 ms |
21440 KB |
Output is correct |
| 7 |
Correct |
11 ms |
21388 KB |
Output is correct |
| 8 |
Correct |
83 ms |
22360 KB |
Output is correct |
| 9 |
Correct |
81 ms |
22288 KB |
Output is correct |
| 10 |
Correct |
85 ms |
22364 KB |
Output is correct |
| 11 |
Correct |
117 ms |
24700 KB |
Output is correct |
| 12 |
Correct |
95 ms |
23920 KB |
Output is correct |
| 13 |
Correct |
84 ms |
24700 KB |
Output is correct |
| 14 |
Correct |
100 ms |
22260 KB |
Output is correct |
| 15 |
Correct |
107 ms |
23628 KB |
Output is correct |
| 16 |
Runtime error |
26 ms |
43380 KB |
Execution killed with signal 6 |
| 17 |
Halted |
0 ms |
0 KB |
- |
