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

• 問題: No.1439 Let's Compare!!!!
• ユーザー: 👑 Kazun
• 提出日時: 2021-03-28 05:06:25
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 329 ms / 2,000 ms
• コード長: 2,274 bytes
• コンパイル時間: 374 ms
• コンパイル使用メモリ: 82,324 KB
• 実行使用メモリ: 126,424 KB
• 最終ジャッジ日時: 2024-11-29 08:57:23
• 合計ジャッジ時間: 4,400 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
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
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
import heapq
class Heap_Dict:
    def __init__(self,Mode=True):
        """
        Mode:True→最小値,False→最大値
        """
        self.heap=[]
        self.dict={}
        self.Mode=Mode
    def __bool__(self):
        return bool(self.heap)
    def insert(self,x):
        if self.Mode and not self.is_exist(x):
            heapq.heappush(self.heap,x)
        elif not self.Mode and not self.is_exist(x):
            heapq.heappush(self.heap,-x)
        if x in self.dict:
            self.dict[x]+=1
        else:
            self.dict[x]=1
    def erase(self,x):
        assert (x in self.dict) and (self.dict[x])
        self.dict[x]-=1
        while self.heap:
            y=self.heap[0]
            if not self.Mode:y=-y
            if self.dict[y]==0:
                heapq.heappop(self.heap)
            else:
                break
    def is_exist(self,x):
        return (x in self.dict) and (self.dict[x])
    def get_min(self):
        assert self.Mode
        if self.heap:
            return self.heap[0]
        else:
            return float("inf")
    def get_max(self):
        assert not self.Mode
        if self.heap:
            return -self.heap[0]
        else:
            return -float("inf")
    def count(self,x):
        if x not in self.dict:
            return 0
        else:
            return self.dict[x]
#================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write
N=int(input())
S=list(map(int,input()[:-1]))
T=list(map(int,input()[:-1]))
U=[1 if S[i]!=T[i] else 0 for i in range(N)]
H=Heap_Dict()
H.insert(N)
for i in range(N):
    if U[i]:
        H.insert(i)
Q=int(input())
X=[0]*Q
for i in range(Q):
    c,x,y=input().split()
    x=int(x);y=int(y)
    if c=="S":
        S[x-1]=y
    else:
        T[x-1]=y
    z=1 if S[x-1]!=T[x-1] else 0
    if z==1 and U[x-1]==0:
        U[x-1]=1
        H.insert(x-1)
    if z==0 and U[x-1]==1:
        U[x-1]=0
        H.erase(x-1)
    index=H.get_min()
    if index<N:
        if S[index]>T[index]:
            X[i]=0
        else:
            X[i]=1
    else:
        X[i]=2
def g(x):
    if x==0:
        return ">"
    elif x==1:
        return "<"
    else:
        return "="
write("\n".join(map(g,X)))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX