#733603 (PyPy3) No.1802 Range Score Query for Bracket Sequence

• 問題: No.1802 Range Score Query for Bracket Sequence
• ユーザー: 👑 rin204
• 提出日時: 2022-01-23 09:32:04
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 706 ms / 2,000 ms
• コード長: 2,256 bytes
• コンパイル時間: 148 ms
• コンパイル使用メモリ: 82,516 KB
• 実行使用メモリ: 103,432 KB
• 最終ジャッジ日時: 2024-06-30 02:22:31
• 合計ジャッジ時間: 10,502 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 24

ソースコード

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
class SegTree():
    def __init__(self, n, e, ope, lst=[]):
        self.N0 = 2 ** (n - 1).bit_length()
        self.e = e
        self.ope = ope
        self.data = [e] * (2 * self.N0)
        if lst:
            for i in range(n):
                self.data[self.N0 + i] = lst[i]
            for i in range(self.N0 - 1, 0, -1):
                self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
    
    def f5(self):
        for i in range(self.N0 - 1, 0, -1):
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
                
    def update(self, i, x): #a_iの値をxに更新
        i += self.N0
        self.data[i] = x
        while i > 1:
            i >>= 1
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])
    
    def add(self, i, x):
        self.update(i, x + self.get(i))
    
    def query(self, l, r): #区間[l, r)での演算結果
        if r <= l:
            return self.e
            
        res = self.e
        l += self.N0
        r += self.N0
        while l < r:
            if l & 1:
                res = self.ope(res, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                res = self.ope(res, self.data[r])
            l >>= 1
            r >>= 1
        return res
            
    
    def get(self, i): #a_iの値を返す
        return self.data[self.N0 + i]
n, q = map(int, input().split())
S = list(input())
lst = []
for i in range(n - 1):
    if S[i] == "(" and S[i + 1] == ")":
        lst.append(1)
    else:
        lst.append(0)
e = 0        
def ope(x, y):
    return x + y
seg = SegTree(n - 1, e, ope, lst)
for _ in range(q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        i = query[1] - 1
        if S[i] == "(":
            if i != n - 1 and S[i + 1] == ")":
                seg.update(i, 0)
            S[i] = ")"
            if i != 0 and S[i - 1] == "(":
                seg.update(i - 1, 1)
        else:
            if i != 0 and S[i - 1] == "(":
                seg.update(i - 1, 0)
            S[i] = "("
            if i != n - 1 and S[i + 1] == ")":
                seg.update(i, 1)
    else:
        l, r = query[1:]
        print(seg.query(l - 1, r - 1))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX