#731602 (PyPy3) No.1439 Let's Compare!!!!

• 問題: No.1439 Let's Compare!!!!
• ユーザー: 👑 rin204
• 提出日時: 2022-01-18 05:14:57
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 833 ms / 2,000 ms
• コード長: 2,159 bytes
• コンパイル時間: 386 ms
• コンパイル使用メモリ: 82,512 KB
• 実行使用メモリ: 101,376 KB
• 最終ジャッジ日時: 2024-11-23 13:15:40
• 合計ジャッジ時間: 10,210 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
sample	AC * 2
other	AC * 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
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(self.data[r], res)
            l >>= 1
            r >>= 1
        return res
            
    
    def get(self, i): #a_iの値を返す
        return self.data[self.N0 + i]
e = 0
def ope(x, y):
    if x * y == 0:
        return x + y
    else:
        return x
n = int(input())
S = list(map(int, input()))
T = list(map(int, input()))
lst = []
for s, t in zip(S, T):
    if s < t:
        lst.append(1)
    elif s == t:
        lst.append(0)
    else:
        lst.append(-1)
seg = SegTree(n, e, ope, lst)
q = int(input())
for _ in range(q):
    c, x, y = input().split()
    x = int(x) - 1
    y = int(y)
    if c == "T":
        T[x] = y
    else:
        S[x] = y
    if T[x] > S[x]:
        seg.update(x, 1)
    elif T[x] == S[x]:
        seg.update(x, 0)
    else:
        seg.update(x, -1)
    ans = seg.query(0, n)
    if ans == 1:
        print("<")
    elif ans == 0:
        print("=")
    else:
        print(">")
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX