結果

問題 No.1439 Let's Compare!!!!
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-13 18:55:35
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,228 bytes
コンパイル時間 454 ms
コンパイル使用メモリ 81,568 KB
実行使用メモリ 120,076 KB
最終ジャッジ日時 2023-10-19 06:02:46
合計ジャッジ時間 14,408 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
65,896 KB
testcase_01 AC 59 ms
65,896 KB
testcase_02 AC 62 ms
65,896 KB
testcase_03 AC 60 ms
65,896 KB
testcase_04 WA -
testcase_05 AC 60 ms
65,924 KB
testcase_06 WA -
testcase_07 AC 155 ms
79,872 KB
testcase_08 AC 174 ms
79,284 KB
testcase_09 AC 137 ms
79,040 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 1,298 ms
118,816 KB
testcase_13 WA -
testcase_14 AC 1,287 ms
117,536 KB
testcase_15 AC 1,260 ms
120,076 KB
testcase_16 WA -
testcase_17 AC 1,095 ms
115,092 KB
testcase_18 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
ALP = 26
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x) - 1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x) - 1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - 1].append(b - 1)
        node[b - 1].append(a - 1)
    return node 
def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - 1].append((b - 1, c))
        node[b - 1].append((a - 1, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 
def gcd(x, y):
    if x == 0: return y
    return gcd(y % x, x)
def lcm(a, b):
    return a // gcd(a,b) * b

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def YN(x): print("YES" if x else "NO")
def blank(arr): print(" ".join(map(str, arr)))
def link(arr): print(''.join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False


   
class BIT():
    def __init__(self, N):
        self.size = N
        self.tree = [0] * (N + 1)
 
    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    # A[1] + A[2] + ... + A[i]
    def sum(self, i):
        ret = 0
        while i > 0:
            ret += self.tree[i]
            i -= i & -i
        return ret

    # A[i]
    def get(self, i):
        return self.sum(i) - self.sum(i - 1)
###############################################################################################

N = I()
S = list(ST())
T = list(ST())
Q = I()

tree = BIT(N + 1)
for i in range(N):
    if S[i] != T[i]: tree.add(i + 1, 1)

for _ 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 

    now = tree.get(x)
    if S[x - 1] != T[x - 1]:
        tree.add(x, 1 - now)
    else:
        tree.add(x, - now)

    if tree.sum(N + 1) == 0: print("=")
    else:
        bot = 0
        top = N
        while top - bot > 1:
            mid = top + bot >> 1
            if tree.sum(mid) >= 1: top = mid 
            else: bot = mid 
        
        idx = top - 1
        if int(S[idx]) > int(T[idx]): print(">")
        else: print("<")
0