結果

問題 No.2076 Concon Substrings (ConVersion)
ユーザー とりゐとりゐ
提出日時 2022-09-16 22:21:18
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,725 bytes
コンパイル時間 290 ms
コンパイル使用メモリ 86,756 KB
実行使用メモリ 85,736 KB
最終ジャッジ日時 2023-08-23 16:01:35
合計ジャッジ時間 8,085 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 154 ms
80,120 KB
testcase_01 AC 161 ms
80,124 KB
testcase_02 AC 156 ms
80,072 KB
testcase_03 AC 152 ms
80,068 KB
testcase_04 AC 154 ms
80,220 KB
testcase_05 AC 235 ms
83,488 KB
testcase_06 AC 168 ms
82,648 KB
testcase_07 AC 262 ms
85,076 KB
testcase_08 AC 248 ms
85,504 KB
testcase_09 AC 262 ms
85,332 KB
testcase_10 WA -
testcase_11 AC 157 ms
80,008 KB
testcase_12 AC 159 ms
80,256 KB
testcase_13 AC 155 ms
80,232 KB
testcase_14 AC 160 ms
80,412 KB
testcase_15 AC 288 ms
84,724 KB
testcase_16 WA -
testcase_17 AC 241 ms
84,456 KB
testcase_18 AC 255 ms
85,456 KB
testcase_19 WA -
testcase_20 AC 229 ms
84,092 KB
testcase_21 AC 156 ms
80,248 KB
testcase_22 AC 218 ms
83,492 KB
testcase_23 AC 198 ms
83,396 KB
testcase_24 AC 184 ms
83,132 KB
testcase_25 WA -
testcase_26 AC 225 ms
83,624 KB
testcase_27 AC 206 ms
83,536 KB
testcase_28 WA -
testcase_29 AC 210 ms
83,536 KB
testcase_30 AC 241 ms
85,192 KB
testcase_31 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 

n,a,b=map(int,input().split())
s=input()



c=[]
for i in s:
  c.append(i)
  if len(c)>=3 and c[-3]+c[-2]+c[-1]=='con':
    c.pop()
    c.pop()
    c.pop()
    c.append('!')

c.append('a')
d=[]
tmp=0
for i in c:
  if i=='!':
    tmp+=1
  else:
    if tmp!=0:
      d.append(tmp)
    tmp=0

S=SortedMultiset()
for i in d:
  S.add(i)

tmp=0
while True:
  if tmp%2==0:
    x=S.ge(a)
    if x==None:
      print(tmp)
      exit()
    else:
      S.discard(x)
      S.add(x-a)
  else:
    x=S.ge(b)
    if x==None:
      print(tmp)
      exit()
    else:
      S.discard(x)
      S.add(x-b)
  tmp+=1
0