結果
問題 | No.1439 Let's Compare!!!! |
ユーザー | nephrologist |
提出日時 | 2021-03-26 21:54:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,867 ms / 2,000 ms |
コード長 | 2,368 bytes |
コンパイル時間 | 368 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 127,224 KB |
最終ジャッジ日時 | 2023-08-19 08:10:28 |
合計ジャッジ時間 | 13,078 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,356 KB |
testcase_01 | AC | 73 ms
71,468 KB |
testcase_02 | AC | 69 ms
71,516 KB |
testcase_03 | AC | 70 ms
71,524 KB |
testcase_04 | AC | 69 ms
71,424 KB |
testcase_05 | AC | 69 ms
71,248 KB |
testcase_06 | AC | 67 ms
71,396 KB |
testcase_07 | AC | 193 ms
81,436 KB |
testcase_08 | AC | 236 ms
80,868 KB |
testcase_09 | AC | 156 ms
79,268 KB |
testcase_10 | AC | 1,060 ms
113,480 KB |
testcase_11 | AC | 1,141 ms
121,012 KB |
testcase_12 | AC | 903 ms
113,984 KB |
testcase_13 | AC | 1,088 ms
113,980 KB |
testcase_14 | AC | 1,572 ms
120,284 KB |
testcase_15 | AC | 1,196 ms
127,224 KB |
testcase_16 | AC | 934 ms
115,620 KB |
testcase_17 | AC | 1,867 ms
109,800 KB |
testcase_18 | AC | 516 ms
103,036 KB |
ソースコード
from heapq import heappop, heappush n = int(input()) s = list(map(int, list(input()))) t = list(map(int, list(input()))) q = int(input()) s_bigger = [] s_bigger_del = [] t_bigger = [] t_bigger_del = [] for i in range(n): if s[i] > t[i]: heappush(s_bigger, i * 10 + s[i]) elif s[i] < t[i]: heappush(t_bigger, i * 10 + t[i]) for _ in range(q): # delのものを消す while s_bigger_del: if s_bigger[0] == s_bigger_del[0]: heappop(s_bigger) heappop(s_bigger_del) else: break while t_bigger_del: if t_bigger[0] == t_bigger_del[0]: heappop(t_bigger) heappop(t_bigger_del) else: break c, x, y = input().split() x = int(x) y = int(y) if c == "S": if s[x - 1] > t[x - 1]: heappush(s_bigger_del, (x - 1) * 10 + s[x - 1]) elif s[x - 1] < t[x - 1]: heappush(t_bigger_del, (x - 1) * 10 + t[x - 1]) s[x - 1] = y if s[x - 1] > t[x - 1]: heappush(s_bigger, (x - 1) * 10 + s[x - 1]) elif t[x - 1] > s[x - 1]: heappush(t_bigger, (x - 1) * 10 + t[x - 1]) else: if s[x - 1] > t[x - 1]: heappush(s_bigger_del, (x - 1) * 10 + s[x - 1]) elif s[x - 1] < t[x - 1]: heappush(t_bigger_del, (x - 1) * 10 + t[x - 1]) t[x - 1] = y if s[x - 1] > t[x - 1]: heappush(s_bigger, (x - 1) * 10 + s[x - 1]) elif t[x - 1] > s[x - 1]: heappush(t_bigger, (x - 1) * 10 + t[x - 1]) while s_bigger_del: if s_bigger[0] == s_bigger_del[0]: heappop(s_bigger) heappop(s_bigger_del) else: break while t_bigger_del: if t_bigger[0] == t_bigger_del[0]: heappop(t_bigger) heappop(t_bigger_del) else: break if not s_bigger and not t_bigger: print("=") elif not s_bigger: print("<") elif not t_bigger: print(">") else: ttt = t_bigger[0] // 10 sss = s_bigger[0] // 10 if sss < ttt: print(">") else: print("<") # print("s", "".join(map(str, s))) # print("t", "".join(map(str, t))) # print("s", s_bigger, s_bigger_del) # print("t", t_bigger, t_bigger_del)