結果

問題 No.1951 消えたAGCT(2)
ユーザー 👑 H20H20
提出日時 2022-03-25 00:07:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,082 ms / 3,000 ms
コード長 4,693 bytes
コンパイル時間 263 ms
コンパイル使用メモリ 87,252 KB
実行使用メモリ 266,148 KB
最終ジャッジ日時 2023-09-09 03:31:16
合計ジャッジ時間 14,626 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 176 ms
80,280 KB
testcase_01 AC 179 ms
80,388 KB
testcase_02 AC 172 ms
80,376 KB
testcase_03 AC 173 ms
80,224 KB
testcase_04 AC 178 ms
80,216 KB
testcase_05 AC 179 ms
80,352 KB
testcase_06 AC 177 ms
80,236 KB
testcase_07 AC 178 ms
80,076 KB
testcase_08 AC 252 ms
117,904 KB
testcase_09 AC 250 ms
117,688 KB
testcase_10 AC 248 ms
117,840 KB
testcase_11 AC 246 ms
117,904 KB
testcase_12 AC 222 ms
103,312 KB
testcase_13 AC 243 ms
84,448 KB
testcase_14 AC 969 ms
227,584 KB
testcase_15 AC 819 ms
185,660 KB
testcase_16 AC 828 ms
190,436 KB
testcase_17 AC 994 ms
230,040 KB
testcase_18 AC 1,029 ms
238,984 KB
testcase_19 AC 1,082 ms
266,148 KB
testcase_20 AC 1,028 ms
249,808 KB
testcase_21 AC 247 ms
117,768 KB
testcase_22 AC 246 ms
117,652 KB
testcase_23 AC 248 ms
117,644 KB
testcase_24 AC 248 ms
117,732 KB
testcase_25 AC 246 ms
117,612 KB
testcase_26 AC 1,038 ms
224,504 KB
testcase_27 AC 1,003 ms
231,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
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

n = int(input())
s = list(input())
LEFT = [0]*26
EXISTS = SortedSet(list(range(n)))
import collections
CA = collections.Counter(s)

CHECK = []
for c in ['A','G','C','T']:
    CHECK.append(ord(c)-65)

while True:
    cnt = 0
    for check in CHECK:
        cnt+=CA[chr((check+26)%26+65)]
    if cnt==0:
        break
    i = EXISTS[cnt-1]
    CA[s[i]]-=1
    EXISTS.discard(i)
    r = CA[s[i]]
    for j in range(len(CHECK)):
        CHECK[j]=(CHECK[j]-r)%26
print(n-len(EXISTS))
0