#1031612 (PyPy3) No.2992 Range ABCD String Query

• 問題: No.2992 Range ABCD String Query
• ユーザー: lif4635
• 提出日時: 2024-12-15 10:30:21
• 言語: PyPy3 (7.3.15)
• 結果: MLE
• 実行時間: -
• コード長: 2,571 bytes
• コンパイル時間: 456 ms
• コンパイル使用メモリ: 82,488 KB
• 実行使用メモリ: 703,028 KB
• 最終ジャッジ日時: 2024-12-16 23:34:36
• 合計ジャッジ時間: 189,025 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
other	AC * 12 TLE * 12 MLE * 17

ソースコード

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
class SegTree:
    def __init__(self, op, e, lst):
        if type(lst) is int:
            self.n = lst 
        else:
            self.n = len(lst)
        self.N0 = 2 ** (self.n - 1).bit_length()
        self.op = op
        self.e = e
        self.data = [e] * (2 * self.N0)
        if type(lst) is list:
            for i in range(self.n):
                self.data[self.N0 + i] = lst[i]
            for i in range(self.N0 - 1, 0, -1):
                self.data[i] = self.op(self.data[2*i], self.data[2*i+1])
    
    def get(self, i):
        return self.data[self.N0+i]
    
    def update(self, i, x): #a_iの値をxに更新
        i += self.N0
        self.data[i] = x
        while i > 1:
            i >>= 1
            self.data[i] = self.op(self.data[2*i], self.data[2*i+1])
    
    def add(self, i, x):
        i += self.N0
        self.data[i] = self.op(x, self.data[i])
        while i > 1:
            i >>= 1
            self.data[i] = self.op(self.data[2*i], self.data[2*i+1])
    
    def set(self, i, x):
        i += self.N0
        self.data[i] = x
        while i > 1:
            i >>= 1
            self.data[i] = self.op(self.data[2*i], self.data[2*i+1])
    
    def prod(self, l, r):
        if r <= l:
            return self.e
        lres = self.e
        rres = self.e
        l += self.N0
        r += self.N0
        while l < r:
            if l & 1:
                lres = self.op(lres, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                rres = self.op(self.data[r], rres)
            l >>= 1
            r >>= 1
        return self.op(lres, rres)
inf = 1<<60
N,Q = map(int, input().split())
S = input()
def make_matrix(c):
    x = ord(c) - ord("A")
    A = [[inf]*4 for i in range(4)]
    for i in range(4):
        for j in range(i,4):
            if i <= x <= j:
                A[i][j] = 0
            else:
                A[i][j] = 1
    return A
D = []
for i in range(N):
    D.append(make_matrix(S[i]))
def op(X,Y):
    res = [[inf]*4 for i in range(4)]
    for i in range(4):
        for j in range(i,4):
            for k in range(i,j+1):
                res[i][j] = min(X[i][k]+Y[k][j], res[i][j]) 
    return res
e = [[0]*4 for i in range(4)]
st = SegTree(op, e, D)
for _ in range(Q):
    t,x,c = input().split()
    
    if t == "1":
        x = int(x)-1
        st.set(x,make_matrix(c))
    else:
        l,r = int(x)-1,int(c)
        res = st.prod(l,r)
        
        ans = inf
        for i in range(4):
            ans = min(ans,min(res[i]))
        print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX