結果

問題 No.1439 Let's Compare!!!!
ユーザー FromBooskaFromBooska
提出日時 2023-06-03 18:02:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,275 ms / 2,000 ms
コード長 5,130 bytes
コンパイル時間 391 ms
コンパイル使用メモリ 82,448 KB
実行使用メモリ 105,880 KB
最終ジャッジ日時 2024-06-09 03:42:29
合計ジャッジ時間 13,303 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
67,712 KB
testcase_01 AC 67 ms
68,340 KB
testcase_02 AC 65 ms
68,272 KB
testcase_03 AC 66 ms
68,808 KB
testcase_04 AC 68 ms
69,504 KB
testcase_05 AC 67 ms
69,456 KB
testcase_06 AC 62 ms
69,044 KB
testcase_07 AC 191 ms
80,212 KB
testcase_08 AC 248 ms
80,740 KB
testcase_09 AC 166 ms
80,644 KB
testcase_10 AC 1,254 ms
103,080 KB
testcase_11 AC 1,208 ms
98,340 KB
testcase_12 AC 1,076 ms
97,840 KB
testcase_13 AC 1,264 ms
105,880 KB
testcase_14 AC 1,275 ms
104,724 KB
testcase_15 AC 1,169 ms
97,848 KB
testcase_16 AC 900 ms
97,968 KB
testcase_17 AC 933 ms
97,824 KB
testcase_18 AC 691 ms
98,228 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# S, Tの数字が異なる桁をmultisetに入れておくのはどうか
# 数字が変わって同じになればdiscard
# 数字が変わって異なればadd
# 大小はmultisetの最小の数字の桁だけ調べればいい
# 全部が同じ時に注意

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i: yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i): yield j
    
    def __len__(self) -> int:
        return self.size
    
    def __repr__(self) -> str:
        return "SortedMultiset" + str(self.a)
    
    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def count(self, x: T) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    def add(self, x: T) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Union[T, None]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Union[T, None]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Union[T, None]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]
    
    def __getitem__(self, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans


# 巨大すぎる数字はstringで受ける

N = int(input())
S = list(map(int, input()))
T = list(map(int, input()))
SMS = SortedMultiset([])
for i in range(N):
    if S[i] != T[i]:
        SMS.add(i)

Q = int(input())
for q in range(Q):
    query = list(map(str, input().split()))
    d, num = int(query[1])-1, int(query[2])
    if query[0] == 'S':
        S[d] = num
    else:
        T[d] = num
        
    if S[d] == T[d]:
        SMS.discard(d)
    else:
        if d not in SMS:
            SMS.add(d)
    
    if len(SMS) == 0:
        print('=')
    elif S[SMS[0]] > T[SMS[0]]:
        print('>')
    else:
        print('<')
        
    #print(SMS)
0