結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー rlangevinrlangevin
提出日時 2023-05-19 22:03:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,013 ms / 2,000 ms
コード長 5,376 bytes
コンパイル時間 539 ms
コンパイル使用メモリ 87,132 KB
実行使用メモリ 201,340 KB
最終ジャッジ日時 2023-08-23 00:00:12
合計ジャッジ時間 37,179 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 154 ms
80,376 KB
testcase_01 AC 827 ms
122,880 KB
testcase_02 AC 845 ms
127,952 KB
testcase_03 AC 810 ms
118,580 KB
testcase_04 AC 795 ms
122,020 KB
testcase_05 AC 930 ms
131,660 KB
testcase_06 AC 859 ms
143,196 KB
testcase_07 AC 953 ms
143,084 KB
testcase_08 AC 1,013 ms
130,736 KB
testcase_09 AC 923 ms
130,612 KB
testcase_10 AC 914 ms
125,504 KB
testcase_11 AC 954 ms
141,372 KB
testcase_12 AC 942 ms
141,168 KB
testcase_13 AC 960 ms
138,572 KB
testcase_14 AC 954 ms
135,408 KB
testcase_15 AC 950 ms
139,572 KB
testcase_16 AC 939 ms
135,056 KB
testcase_17 AC 951 ms
132,648 KB
testcase_18 AC 963 ms
138,408 KB
testcase_19 AC 947 ms
138,568 KB
testcase_20 AC 945 ms
136,860 KB
testcase_21 AC 963 ms
147,320 KB
testcase_22 AC 964 ms
147,164 KB
testcase_23 AC 959 ms
147,404 KB
testcase_24 AC 975 ms
147,328 KB
testcase_25 AC 972 ms
147,296 KB
testcase_26 AC 960 ms
147,288 KB
testcase_27 AC 974 ms
147,340 KB
testcase_28 AC 969 ms
147,256 KB
testcase_29 AC 971 ms
147,268 KB
testcase_30 AC 971 ms
147,552 KB
testcase_31 AC 736 ms
201,340 KB
testcase_32 AC 740 ms
200,920 KB
testcase_33 AC 720 ms
195,964 KB
testcase_34 AC 809 ms
189,700 KB
testcase_35 AC 817 ms
187,120 KB
testcase_36 AC 817 ms
189,984 KB
testcase_37 AC 378 ms
87,304 KB
testcase_38 AC 946 ms
129,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

# 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

################################

T = int(input())
for _ in range(T):
    N = int(input())
    X = list(input().split())
    Y = list(input().split())
    S = list(map(int, input().split()))
    SS = SortedSet(range(N))
    SSY = SortedSet(range(N - 1))
    for i in range(N):
        if X[i] == "True":
            X[i] = 1
        else:
            X[i] = 0

    for s in S:
        s -= 1
        ind_l = SS[s]
        ind_r = SS.gt(ind_l)
        SS.discard(ind_r)
        ind_y = SSY[s]
        SSY.discard(ind_y)
        if Y[ind_y] == "and":
            new = X[ind_l] & X[ind_r]
        elif Y[ind_y] == "or":
            new = X[ind_l] | X[ind_r]
        elif Y[ind_y] == "xor":
            new = X[ind_l] ^ X[ind_r]
        else:
            if X[ind_l]:
                new = X[ind_r]
            else:
                new = 1
        X[ind_l] = new
        # print("test", ind_l, ind_r, SS, X, Y[ind_y])
    
    print("True") if X[SS[0]] else print("False")
0