結果
| 問題 | No.2308 [Cherry 5th Tune B] もしかして、真? |
| ユーザー |
 ニックネーム
|
| 提出日時 | 2023-05-19 22:31:11 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 618 ms / 2,000 ms |
| コード長 | 4,673 bytes |
| コンパイル時間 | 182 ms |
| コンパイル使用メモリ | 82,176 KB |
| 実行使用メモリ | 142,776 KB |
| 最終ジャッジ日時 | 2024-05-10 05:57:56 |
| 合計ジャッジ時間 | 23,035 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 82 ms
67,584 KB |
| testcase_01 | AC | 538 ms
104,384 KB |
| testcase_02 | AC | 540 ms
128,948 KB |
| testcase_03 | AC | 490 ms
111,136 KB |
| testcase_04 | AC | 488 ms
108,176 KB |
| testcase_05 | AC | 572 ms
110,300 KB |
| testcase_06 | AC | 528 ms
114,880 KB |
| testcase_07 | AC | 583 ms
118,512 KB |
| testcase_08 | AC | 618 ms
118,296 KB |
| testcase_09 | AC | 550 ms
117,708 KB |
| testcase_10 | AC | 574 ms
111,708 KB |
| testcase_11 | AC | 584 ms
116,616 KB |
| testcase_12 | AC | 588 ms
126,592 KB |
| testcase_13 | AC | 597 ms
114,672 KB |
| testcase_14 | AC | 571 ms
116,744 KB |
| testcase_15 | AC | 580 ms
116,108 KB |
| testcase_16 | AC | 580 ms
127,748 KB |
| testcase_17 | AC | 578 ms
114,860 KB |
| testcase_18 | AC | 580 ms
125,240 KB |
| testcase_19 | AC | 582 ms
125,864 KB |
| testcase_20 | AC | 574 ms
116,084 KB |
| testcase_21 | AC | 582 ms
125,456 KB |
| testcase_22 | AC | 574 ms
124,304 KB |
| testcase_23 | AC | 595 ms
124,048 KB |
| testcase_24 | AC | 576 ms
124,468 KB |
| testcase_25 | AC | 575 ms
125,080 KB |
| testcase_26 | AC | 577 ms
124,092 KB |
| testcase_27 | AC | 598 ms
125,720 KB |
| testcase_28 | AC | 579 ms
125,088 KB |
| testcase_29 | AC | 597 ms
125,340 KB |
| testcase_30 | AC | 576 ms
124,308 KB |
| testcase_31 | AC | 407 ms
142,776 KB |
| testcase_32 | AC | 400 ms
136,304 KB |
| testcase_33 | AC | 402 ms
141,964 KB |
| testcase_34 | AC | 482 ms
131,120 KB |
| testcase_35 | AC | 477 ms
131,896 KB |
| testcase_36 | AC | 480 ms
130,068 KB |
| testcase_37 | AC | 340 ms
81,968 KB |
| testcase_38 | AC | 574 ms
117,160 KB |
ソースコード
# 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
for _ in range(int(input())):
n = int(input())
d = {"False":0,"True":1}
x = [d[v] for v in input().split()]
y = list(input().split())
ss = SortedSet(range(n))
for v in map(int,input().split()):
l = ss[v-1]; r = ss[v]; ss.discard(l)
if y[l]=="and": x[r] &= x[l]
if y[l]=="or": x[r] |= x[l]
if y[l]=="xor": x[r] ^= x[l]
if y[l]=="imp": x[r] = x[r] if x[l] else 1
print("True" if x[ss[0]] else "False")