結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー mkawa2mkawa2
提出日時 2023-05-19 22:12:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 928 ms / 2,000 ms
コード長 5,535 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 82,816 KB
実行使用メモリ 134,884 KB
最終ジャッジ日時 2024-06-02 10:42:28
合計ジャッジ時間 32,186 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
67,328 KB
testcase_01 AC 832 ms
108,324 KB
testcase_02 AC 680 ms
111,516 KB
testcase_03 AC 694 ms
106,020 KB
testcase_04 AC 672 ms
116,788 KB
testcase_05 AC 826 ms
102,620 KB
testcase_06 AC 698 ms
129,248 KB
testcase_07 AC 928 ms
111,572 KB
testcase_08 AC 895 ms
121,808 KB
testcase_09 AC 708 ms
121,472 KB
testcase_10 AC 905 ms
108,920 KB
testcase_11 AC 901 ms
115,640 KB
testcase_12 AC 919 ms
117,300 KB
testcase_13 AC 740 ms
123,052 KB
testcase_14 AC 841 ms
124,224 KB
testcase_15 AC 908 ms
115,376 KB
testcase_16 AC 903 ms
117,804 KB
testcase_17 AC 812 ms
121,416 KB
testcase_18 AC 915 ms
117,208 KB
testcase_19 AC 921 ms
118,228 KB
testcase_20 AC 927 ms
123,960 KB
testcase_21 AC 729 ms
124,112 KB
testcase_22 AC 718 ms
122,704 KB
testcase_23 AC 722 ms
122,824 KB
testcase_24 AC 721 ms
122,900 KB
testcase_25 AC 734 ms
123,600 KB
testcase_26 AC 696 ms
123,216 KB
testcase_27 AC 716 ms
124,364 KB
testcase_28 AC 720 ms
124,096 KB
testcase_29 AC 712 ms
123,600 KB
testcase_30 AC 713 ms
122,696 KB
testcase_31 AC 356 ms
127,968 KB
testcase_32 AC 369 ms
131,716 KB
testcase_33 AC 381 ms
134,884 KB
testcase_34 AC 419 ms
121,988 KB
testcase_35 AC 429 ms
122,388 KB
testcase_36 AC 439 ms
121,988 KB
testcase_37 AC 366 ms
85,684 KB
testcase_38 AC 799 ms
116,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
0