#870469 (PyPy3) No.2308 [Cherry 5th Tune B] もしかして、真?

提出ソース

結果

問題	No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー	mkawa2
提出日時	2023-05-19 22:12:44
言語	PyPy3 (7.3.15)
結果	AC
実行時間	1,133 ms / 2,000 ms
コード長	5,535 bytes
コンパイル時間	729 ms
コンパイル使用メモリ	87,196 KB
実行使用メモリ	131,976 KB
最終ジャッジ日時	2023-08-24 21:23:18
合計ジャッジ時間	40,954 ms
ジャッジサーバーID （参考情報）	judge14 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	166 ms 80,196 KB
testcase_01	AC	1,055 ms 116,412 KB
testcase_02	AC	832 ms 119,524 KB
testcase_03	AC	829 ms 113,936 KB
testcase_04	AC	849 ms 116,204 KB
testcase_05	AC	1,005 ms 120,560 KB
testcase_06	AC	857 ms 131,396 KB
testcase_07	AC	1,128 ms 117,896 KB
testcase_08	AC	1,089 ms 116,272 KB
testcase_09	AC	865 ms 115,132 KB
testcase_10	AC	1,121 ms 116,652 KB
testcase_11	AC	1,133 ms 122,500 KB
testcase_12	AC	1,126 ms 123,108 KB
testcase_13	AC	906 ms 119,600 KB
testcase_14	AC	1,018 ms 131,976 KB
testcase_15	AC	1,124 ms 122,496 KB
testcase_16	AC	1,116 ms 125,556 KB
testcase_17	AC	1,010 ms 119,308 KB
testcase_18	AC	1,117 ms 124,420 KB
testcase_19	AC	1,117 ms 124,884 KB
testcase_20	AC	1,122 ms 129,872 KB
testcase_21	AC	880 ms 121,728 KB
testcase_22	AC	881 ms 120,612 KB
testcase_23	AC	891 ms 120,692 KB
testcase_24	AC	900 ms 120,668 KB
testcase_25	AC	909 ms 121,884 KB
testcase_26	AC	900 ms 120,524 KB
testcase_27	AC	914 ms 121,752 KB
testcase_28	AC	904 ms 121,856 KB
testcase_29	AC	906 ms 121,772 KB
testcase_30	AC	888 ms 120,832 KB
testcase_31	AC	488 ms 122,992 KB
testcase_32	AC	493 ms 122,608 KB
testcase_33	AC	489 ms 124,840 KB
testcase_34	AC	567 ms 120,180 KB
testcase_35	AC	566 ms 120,540 KB
testcase_36	AC	564 ms 120,408 KB
testcase_37	AC	513 ms 88,632 KB
testcase_38	AC	1,006 ms 129,224 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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
md = 10**9+7
# md = 998244353

# Thanks for tatyam
# 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, Optional, 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) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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

ops = ["and", "or", "xor", "imp"]

def solve():
    n = II()
    xx = [c == "True" for c in SI().split()]
    yy = [ops.index(c) for c in SI().split()]
    idx = SortedSet(range(n))

    for s in LI1():
        i, j = idx[s], idx[s+1]
        if yy[i] == 0:
            xx[j] &= xx[i]
        if yy[i] == 1:
            xx[j] |= xx[i]
        if yy[i] == 2:
            xx[j] ^= xx[i]
        if yy[i] == 3:
            if xx[i] == 1 and xx[j] == 0:
                xx[j] = 0
            else:
                xx[j] = 1
        idx.discard(i)

    i = idx[0]
    print("True" if xx[i] else "False")

for _ in range(II()): solve()

yukicoder

結果

テストケース

ソースコード