Submission #77585

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
#include <bits/stdc++.h>
using namespace std;
template< typename T, typename F >
struct SegmentTree {
int n, sz;
vector< T > seg;
const F f;
const T ti;
SegmentTree() = default;
explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {
sz = 1;
while(sz < n) sz <<= 1;
seg.assign(2 * sz, ti);
}
explicit SegmentTree(const vector< T > &v, const F f, const T &ti) :
SegmentTree((int) v.size(), f, ti) {
build(v);
}
void build(const vector< T > &v) {
assert(n == (int) v.size());
for(int k = 0; k < n; k++) seg[k + sz] = v[k];
for(int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const T &x) {
k += sz;
seg[k] = x;
while(k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
T get(int k) const {
return seg[k + sz];
}
T operator[](const int &k) const {
return get(k);
}
void apply(int k, const T &x) {
k += sz;
seg[k] = f(seg[k], x);
while(k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
T query(int l, int r) const {
T L = ti, R = ti;
for(l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
if(l & 1) L = f(L, seg[l++]);
if(r & 1) R = f(seg[--r], R);
}
return f(L, R);
}
T query() const {
return seg[1];
}
template< typename C >
int find_first(int l, const C &check) const {
if(l >= n) return n;
l += sz;
T sum = ti;
do {
while((l & 1) == 0) l >>= 1;
if(check(f(sum, seg[l]))) {
while(l < sz) {
l <<= 1;
auto nxt = f(sum, seg[l]);
if(not check(nxt)) {
sum = nxt;
l++;
}
}
return l + 1 - sz;
}
sum = f(sum, seg[l++]);
} while((l & -l) != l);
return n;
}
template< typename C >
int find_last(int r, const C &check) const {
if(r <= 0) return -1;
r += sz;
T sum = ti;
do {
r--;
while(r > 1 and (r & 1)) r >>= 1;
if(check(f(seg[r], sum))) {
while(r < sz) {
r = (r << 1) + 1;
auto nxt = f(seg[r], sum);
if(not check(nxt)) {
sum = nxt;
r--;
}
}
return r - sz;
}
sum = f(seg[r], sum);
} while((r & -r) != r);
return -1;
}
};
template< typename T, typename F >
SegmentTree< T, F > get_segment_tree(int N, const F &f, const T &ti) {
return SegmentTree{N, f, ti};
}
template< typename T, typename F >
SegmentTree< T, F > get_segment_tree(const vector< T > &v, const F &f, const T &ti) {
return SegmentTree{v, f, ti};
}
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
auto rsq = get_segment_tree(n, [](int l, int r) { return l + r; }, 0);
auto seg_h = rsq, seg_o = rsq, seg_j = rsq;
for (int i = 0; i < n; ++i) {
if (s[i] == 'H') seg_h.update(i, 1);
if (s[i] == 'O') seg_o.update(i, 1);
if (s[i] == 'J') seg_j.update(i, 1);
}
auto check = [&](int l, int r, int key) -> bool {
l = seg_h.find_first(l, [&](int v) { return v >= key; });
r = seg_j.find_last(r, [&](int v) { return v >= key; });
return l < r && seg_o.query(l, r) >= key;
};
for (int i = 0; i < q; ++i) {
int com;
cin >> com;
if (com == 1) {
int p;
char c;
cin >> p >> c;
--p;
if (s[p] == 'H') seg_h.update(p, 0);
if (s[p] == 'O') seg_o.update(p, 0);
if (s[p] == 'J') seg_j.update(p, 0);
s[p] = c;
if (s[p] == 'H') seg_h.update(p, 1);
if (s[p] == 'O') seg_o.update(p, 1);
if (s[p] == 'J') seg_j.update(p, 1);
} else {
int l, r;
cin >> l >> r;
--l;
int ok = 0, ng = n / 3 + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (check(l, r, mid)) ok = mid;
else ng = mid;
}
cout << ok << '\n';
}
}
return (0);
}

ステータス

項目 データ
問題 1736 - HOJ-Substrings
ユーザー名 ei1903
投稿日時 2024-02-21 11:09:20
言語 C++17
状態 Accepted
得点 5
ソースコード長 4852 Byte
最大実行時間 1517 ms
最大メモリ使用量 36544 KB

セット

セット 得点 Cases
1 ALL 5 / 5 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
00_sample_00.in AC 34 ms 472 KB
1
01_small_00.in AC 25 ms 428 KB
1
01_small_01.in AC 19 ms 384 KB
1
01_small_02.in AC 19 ms 468 KB
1
01_small_03.in AC 23 ms 548 KB
1
01_small_04.in AC 14 ms 380 KB
1
02_corner_minimum_00.in AC 18 ms 468 KB
1
02_corner_minimum_01.in AC 22 ms 548 KB
1
02_corner_minimum_02.in AC 20 ms 508 KB
1
02_corner_minimum_03.in AC 20 ms 588 KB
1
02_corner_minimum_04.in AC 18 ms 544 KB
1
02_corner_minimum_05.in AC 19 ms 496 KB
1
02_corner_minimum_06.in AC 19 ms 584 KB
1
03_general_00.in AC 20 ms 544 KB
1
03_general_01.in AC 22 ms 500 KB
1
04_random_00.in AC 32 ms 452 KB
1
04_random_01.in AC 22 ms 536 KB
1
04_random_02.in AC 24 ms 488 KB
1
04_random_03.in AC 19 ms 564 KB
1
05_large_00.in AC 16 ms 628 KB
1
05_large_01.in AC 25 ms 692 KB
1
05_large_02.in AC 18 ms 696 KB
1
05_large_03.in AC 23 ms 708 KB
1
06_corner_maximum_00.in AC 818 ms 18080 KB
1
06_corner_maximum_01.in AC 829 ms 18896 KB
1
06_corner_maximum_02.in AC 740 ms 19712 KB
1
06_corner_maximum_03.in AC 324 ms 20528 KB
1
06_corner_maximum_04.in AC 434 ms 22368 KB
1
06_corner_maximum_05.in AC 810 ms 23052 KB
1
07_corner_critical_00.in AC 166 ms 23612 KB
1
07_corner_critical_01.in AC 410 ms 25576 KB
1
07_corner_critical_02.in AC 761 ms 26396 KB
1
07_corner_critical_03.in AC 361 ms 27332 KB
1
07_corner_critical_04.in AC 428 ms 29428 KB
1
07_corner_critical_05.in AC 802 ms 30248 KB
1
07_corner_critical_06.in AC 751 ms 30936 KB
1
07_corner_critical_07.in AC 98 ms 30852 KB
1
07_corner_critical_08.in AC 800 ms 31676 KB
1
07_corner_critical_09.in AC 1512 ms 33256 KB
1
07_corner_critical_10.in AC 1517 ms 34836 KB
1
07_corner_critical_11.in AC 1411 ms 36544 KB
1