Submission #77588

ソースコード

?
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
#include <bits/stdc++.h>
using namespace std;
template< typename T >
struct BinaryIndexedTree {
private:
vector< T > data;
public:
BinaryIndexedTree() = default;
explicit BinaryIndexedTree(size_t sz) : data(sz + 1, 0) {}
explicit BinaryIndexedTree(const vector< T > &vs) : data(vs.size() + 1, 0) {
for(size_t i = 0; i < vs.size(); i++) data[i + 1] = vs[i];
for(size_t i = 1; i < data.size(); i++) {
size_t j = i + (i & -i);
if(j < data.size()) data[j] += data[i];
}
}
void add(int k, const T &x) {
for(++k; k < (int) data.size(); k += k & -k) data[k] += x;
}
T fold(int r) const {
T ret = T();
for(; r > 0; r -= r & -r) ret += data[r];
return ret;
}
T fold(int l, int r) const {
return fold(r) - fold(l);
}
int lower_bound(T x) const {
int i = 0;
for(int k = 1 << (__lg(data.size() - 1) + 1); k > 0; k >>= 1) {
if(i + k < data.size() && data[i + k] < x) {
x -= data[i + k];
i += k;
}
}
return i;
}
int upper_bound(T x) const {
int i = 0;
for(int k = 1 << (__lg(data.size() - 1) + 1); k > 0; k >>= 1) {
if(i + k < data.size() && data[i + k] <= x) {
x -= data[i + k];
i += k;
}
}
return i;
}
};
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n, q;
cin >> n >> q;
string s;
cin >> s;
BinaryIndexedTree<int> bit_h(n), bit_o(n), bit_j(n);
for (int i = 0; i < n; ++i) {
if (s[i] == 'H') bit_h.add(i, 1);
if (s[i] == 'O') bit_o.add(i, 1);
if (s[i] == 'J') bit_j.add(n - i - 1, 1);
}
auto check = [&](int l, int r, int key) -> bool {
l = bit_h.lower_bound(key + bit_h.fold(l)) + 1;
r = n - bit_j.lower_bound(key + bit_j.fold(n - r - 1)) - 1;
return l < r && bit_o.fold(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') bit_h.add(p, -1);
if (s[p] == 'O') bit_o.add(p, -1);
if (s[p] == 'J') bit_j.add(n - p - 1, -1);
s[p] = c;
if (s[p] == 'H') bit_h.add(p, 1);
if (s[p] == 'O') bit_o.add(p, 1);
if (s[p] == 'J') bit_j.add(n - p - 1, 1);
} else {
int l, r;
cin >> l >> r;
--l, --r;
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 13:12:28
言語 C++17
状態 Accepted
得点 5
ソースコード長 3012 Byte
最大実行時間 1313 ms
最大メモリ使用量 23596 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
00_sample_00.in AC 16 ms 476 KB
1
01_small_00.in AC 19 ms 428 KB
1
01_small_01.in AC 23 ms 512 KB
1
01_small_02.in AC 19 ms 468 KB
1
01_small_03.in AC 20 ms 420 KB
1
01_small_04.in AC 20 ms 504 KB
1
02_corner_minimum_00.in AC 16 ms 584 KB
1
02_corner_minimum_01.in AC 16 ms 540 KB
1
02_corner_minimum_02.in AC 15 ms 624 KB
1
02_corner_minimum_03.in AC 15 ms 452 KB
1
02_corner_minimum_04.in AC 15 ms 532 KB
1
02_corner_minimum_05.in AC 20 ms 492 KB
1
02_corner_minimum_06.in AC 19 ms 452 KB
1
03_general_00.in AC 19 ms 408 KB
1
03_general_01.in AC 20 ms 488 KB
1
04_random_00.in AC 21 ms 576 KB
1
04_random_01.in AC 21 ms 536 KB
1
04_random_02.in AC 25 ms 620 KB
1
04_random_03.in AC 21 ms 568 KB
1
05_large_00.in AC 23 ms 640 KB
1
05_large_01.in AC 23 ms 580 KB
1
05_large_02.in AC 20 ms 624 KB
1
05_large_03.in AC 23 ms 556 KB
1
06_corner_maximum_00.in AC 691 ms 5224 KB
1
06_corner_maximum_01.in AC 746 ms 6000 KB
1
06_corner_maximum_02.in AC 633 ms 6892 KB
1
06_corner_maximum_03.in AC 235 ms 7664 KB
1
06_corner_maximum_04.in AC 313 ms 9460 KB
1
06_corner_maximum_05.in AC 679 ms 10228 KB
1
07_corner_critical_00.in AC 159 ms 10744 KB
1
07_corner_critical_01.in AC 306 ms 12920 KB
1
07_corner_critical_02.in AC 635 ms 13564 KB
1
07_corner_critical_03.in AC 286 ms 14332 KB
1
07_corner_critical_04.in AC 298 ms 16384 KB
1
07_corner_critical_05.in AC 683 ms 17160 KB
1
07_corner_critical_06.in AC 665 ms 18064 KB
1
07_corner_critical_07.in AC 73 ms 18064 KB
1
07_corner_critical_08.in AC 695 ms 18844 KB
1
07_corner_critical_09.in AC 1313 ms 20384 KB
1
07_corner_critical_10.in AC 1299 ms 21928 KB
1
07_corner_critical_11.in AC 1141 ms 23596 KB
1