結果

問題 No.1951 消えたAGCT(2)
ユーザー mkawa2mkawa2
提出日時 2022-05-20 22:38:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 883 ms / 3,000 ms
コード長 5,274 bytes
コンパイル時間 152 ms
コンパイル使用メモリ 82,668 KB
実行使用メモリ 226,380 KB
最終ジャッジ日時 2024-09-20 08:56:35
合計ジャッジ時間 10,197 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,328 KB
testcase_01 AC 68 ms
67,584 KB
testcase_02 AC 63 ms
68,096 KB
testcase_03 AC 63 ms
67,456 KB
testcase_04 AC 63 ms
67,712 KB
testcase_05 AC 63 ms
67,584 KB
testcase_06 AC 64 ms
67,584 KB
testcase_07 AC 63 ms
67,968 KB
testcase_08 AC 97 ms
89,596 KB
testcase_09 AC 95 ms
89,328 KB
testcase_10 AC 96 ms
89,344 KB
testcase_11 AC 95 ms
89,592 KB
testcase_12 AC 89 ms
83,552 KB
testcase_13 AC 164 ms
80,756 KB
testcase_14 AC 798 ms
194,024 KB
testcase_15 AC 663 ms
173,208 KB
testcase_16 AC 662 ms
163,380 KB
testcase_17 AC 812 ms
209,308 KB
testcase_18 AC 839 ms
212,728 KB
testcase_19 AC 883 ms
226,380 KB
testcase_20 AC 857 ms
226,156 KB
testcase_21 AC 93 ms
89,208 KB
testcase_22 AC 94 ms
89,476 KB
testcase_23 AC 96 ms
89,084 KB
testcase_24 AC 94 ms
89,216 KB
testcase_25 AC 93 ms
89,088 KB
testcase_26 AC 814 ms
203,104 KB
testcase_27 AC 823 ms
204,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

# 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

def ng():
    for c in t:
        if cnt[(c-sft)%26]: return True
    return False

t = [0, 2, 6, 19]
n = II()
cc = [ord(c)-65 for c in SI()]
ii = SortedSet(range(n))

cnt = [0]*26
for c in cc: cnt[c] += 1
sft = 0

ans = 0
while ng():
    c1 = sum(cnt[(c-sft)%26] for c in t)
    i = ii[c1-1]
    cnt[cc[i]] -= 1
    c2 = cnt[cc[i]]
    sft = (sft+c2)%26
    ii.discard(i)
    ans += 1

print(ans)
0