結果

問題 No.2240 WAC
ユーザー tassei903tassei903
提出日時 2023-03-10 21:44:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 97 ms / 2,000 ms
コード長 4,928 bytes
コンパイル時間 448 ms
コンパイル使用メモリ 81,708 KB
実行使用メモリ 88,612 KB
最終ジャッジ日時 2023-10-18 07:30:30
合計ジャッジ時間 5,755 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,640 KB
testcase_01 AC 65 ms
67,640 KB
testcase_02 AC 64 ms
67,640 KB
testcase_03 AC 65 ms
67,640 KB
testcase_04 AC 66 ms
67,640 KB
testcase_05 AC 64 ms
67,640 KB
testcase_06 AC 65 ms
67,640 KB
testcase_07 AC 65 ms
67,640 KB
testcase_08 AC 65 ms
67,640 KB
testcase_09 AC 65 ms
67,640 KB
testcase_10 AC 96 ms
88,612 KB
testcase_11 AC 92 ms
87,036 KB
testcase_12 AC 97 ms
88,584 KB
testcase_13 AC 74 ms
74,428 KB
testcase_14 AC 73 ms
73,580 KB
testcase_15 AC 80 ms
81,912 KB
testcase_16 AC 92 ms
83,808 KB
testcase_17 AC 81 ms
79,872 KB
testcase_18 AC 77 ms
74,208 KB
testcase_19 AC 78 ms
74,960 KB
testcase_20 AC 78 ms
82,056 KB
testcase_21 AC 83 ms
77,400 KB
testcase_22 AC 75 ms
75,896 KB
testcase_23 AC 74 ms
74,428 KB
testcase_24 AC 79 ms
81,884 KB
testcase_25 AC 88 ms
81,068 KB
testcase_26 AC 75 ms
75,344 KB
testcase_27 AC 74 ms
74,172 KB
testcase_28 AC 73 ms
73,604 KB
testcase_29 AC 69 ms
70,676 KB
testcase_30 AC 75 ms
75,900 KB
testcase_31 AC 89 ms
85,120 KB
testcase_32 AC 77 ms
74,180 KB
testcase_33 AC 81 ms
78,964 KB
testcase_34 AC 82 ms
80,920 KB
testcase_35 AC 71 ms
72,592 KB
testcase_36 AC 89 ms
82,224 KB
testcase_37 AC 81 ms
83,408 KB
testcase_38 AC 72 ms
73,612 KB
testcase_39 AC 84 ms
85,008 KB
testcase_40 AC 77 ms
78,148 KB
testcase_41 AC 77 ms
80,752 KB
testcase_42 AC 79 ms
80,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################


# 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,m = na()
s = input()
a = []
for i in range(n*2+m*2):
    if s[i] == "A":
        a.append(i)
r = 0
for i in range(n*2+m*2):
    if s[i] == "C":
        if a[r] > i:
            No()
            exit()
        r += 1
r = 0
for i in range(n*2+m*2-1,-1,-1):
    if s[i] == "W":
        if a[-1-r] < i:
            No()
            exit()
        r += 1
Yes()
0