結果
| 問題 | No.1439 Let's Compare!!!! |
| ユーザー |
 terasa
|
| 提出日時 | 2022-06-06 01:50:50 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 1,062 ms / 2,000 ms |
| コード長 | 5,837 bytes |
| コンパイル時間 | 195 ms |
| コンパイル使用メモリ | 81,748 KB |
| 実行使用メモリ | 148,624 KB |
| 最終ジャッジ日時 | 2023-10-21 03:26:34 |
| 合計ジャッジ時間 | 8,572 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 61 ms
70,268 KB |
| testcase_01 | AC | 60 ms
70,268 KB |
| testcase_02 | AC | 66 ms
70,268 KB |
| testcase_03 | AC | 62 ms
70,268 KB |
| testcase_04 | AC | 63 ms
70,268 KB |
| testcase_05 | AC | 67 ms
70,268 KB |
| testcase_06 | AC | 62 ms
70,268 KB |
| testcase_07 | AC | 143 ms
79,740 KB |
| testcase_08 | AC | 158 ms
80,044 KB |
| testcase_09 | AC | 127 ms
79,336 KB |
| testcase_10 | AC | 1,036 ms
145,036 KB |
| testcase_11 | AC | 681 ms
100,608 KB |
| testcase_12 | AC | 673 ms
99,532 KB |
| testcase_13 | AC | 1,035 ms
148,624 KB |
| testcase_14 | AC | 1,062 ms
148,308 KB |
| testcase_15 | AC | 556 ms
94,768 KB |
| testcase_16 | AC | 436 ms
89,656 KB |
| testcase_17 | AC | 377 ms
89,468 KB |
| testcase_18 | AC | 353 ms
88,928 KB |
ソースコード
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
from bisect import bisect_left, bisect_right
import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')
def index_lt(a, x):
'return largest index s.t. A[i] < x or -1 if it does not exist'
return bisect.bisect_left(a, x) - 1
def index_le(a, x):
'return largest index s.t. A[i] <= x or -1 if it does not exist'
return bisect.bisect_right(a, x) - 1
def index_gt(a, x):
'return smallest index s.t. A[i] > x or len(a) if it does not exist'
return bisect.bisect_right(a, x)
def index_ge(a, x):
'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
return bisect.bisect_left(a, x)
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
T = TypeVar('T')
class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(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 "SortedSet" + 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 add(self, x: T) -> bool:
"Add an element and return True if added. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a = self._find_bucket(x)
i = bisect_left(a, x)
if i != len(a) and a[i] == x:
return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
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
def comp(a, b):
if a == b:
return 0
elif a < b:
return 1
else:
return -1
N = int(input())
S = [int(c) for c in input()[:-1]]
T = [int(c) for c in input()[:-1]]
C = [None] * N
SS = SortedSet()
for i in range(N):
c = comp(S[i], T[i])
C[i] = c
if c == 0:
continue
SS.add((i, c))
Q = int(input())
for _ in range(Q):
t, x, y = input().split()
x = int(x) - 1
y = int(y)
if t == 'S':
S[x] = y
else:
T[x] = y
nc = comp(S[x], T[x])
c = C[x]
if nc != c:
SS.discard((x, c))
if nc != 0:
SS.add((x, nc))
C[x] = nc
if len(SS) > 0:
_, a = SS[0]
print('<' if a == 1 else '>')
else:
print('=')