結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー 👑 KazunKazun
提出日時 2023-04-24 10:39:24
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 641 ms / 2,000 ms
コード長 7,199 bytes
コンパイル時間 384 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 145,100 KB
最終ジャッジ日時 2024-12-18 01:56:09
合計ジャッジ時間 21,475 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

class Fenwick_Tree:
def __init__(self, N, A=None):
self.N=N
if A==None:
self.data=[0]*N
else:
assert len(A)==N
self.data=A
self.__build()
def __build(self):
data=self.data
for i in range(1, self.N+1):
if i+(i&(-i))<=self.N:
data[i+(i&(-i))-1]+=data[i-1]
def add(self, i, x):
i+=1
data=self.data
while i<=self.N:
data[i-1]+=x
i+=i&(-i)
def sum(self, i):
S=0
data=self.data
while i:
S+=data[i-1]
i-=i&(-i)
return S
def range_sum(self,l,r):
return self.sum(r)-self.sum(l)
def bisect_left(self, x, default=-1):
i=0
k=1<<self.N.bit_length()
data=self.data
while k:
if i+k<=self.N and data[i+k-1]<x:
x-=self.data[i+k-1]
i+=k
k>>=1
return i if x else default
def bisect_right(self, x, default=-1):
i=0
k=1<<self.N.bit_length()
data=self.data
while k:
if i+k<=self.N and data[i+k-1]<=x:
x-=self.data[i+k-1]
i+=k
k>>=1
return i if i<self.N else default
class Ordered_Set:
def __init__(self, N, multiple=False, S=None):
self.N=N
self.multiple=bool(multiple)
if (not multiple) and S:
S=[1 if S[i] else 0 for i in range(N)]
self.Fenwick=Fenwick_Tree(N,S)
self.__card=self.Fenwick.sum(N)
def __contains__(self, x):
return bool(self.count(x))
def count(self, x):
return self.Fenwick.range_sum(x,x+1)
def __len__(self):
return self.__card
def __bool__(self):
return bool(len(self))
def add(self, x, k=1):
""" x k () .
"""
if (not self.multiple) and (x in self):
return
if not self.multiple:
k=1
self.Fenwick.add(x,k)
self.__card+=k
def discard(self, x, k=1):
""" x k () .
x: int
k: k=-1 , x .
"""
if x not in self:
return
if k==-1:
k=self.count(x)
elif not self.multiple:
k=1
self.Fenwick.add(x,-k)
self.__card-=k
def remove(self, x):
""" x k () .
x: int
k: k=-1 , x .
"""
if x not in self:
raise KeyError(x)
if k==-1:
k=self.count(x)
elif not self.multiple:
k=1
self.Fenwick.add(x, -k)
self.__card-=k
def get(self, index, default=-1):
size=len(self)
if size<=index or size+index<0:
return default
if index<0:
index+=size
return self.Fenwick.bisect_left(index+1)
def __getitem__(self, index):
size=len(self)
if size<=index or size+index<0:
raise IndexError
if index<0:
index+=size
return self.Fenwick.bisect_left(index+1)
def get_min(self, default=-1):
return self.get(0, default)
def pop_min(self):
y=self.get_min()
if y==-1:
raise IndexError
self.remove(y)
return y
def get_max(self, default=-1):
return self.get(-1, default)
def pop_max(self):
y=self.get_max()
if y==-1:
raise IndexError
self.remove(y)
return y
def index(self, x, mode=False, default=-1):
""" S[k]=x k .
x: int
mode: False k , True k ()
"""
if x not in self:
return default
if mode:
return self.Fenwick.sum(x+1)-1
else:
return self.Fenwick.sum(x)
def previous(self, x, mode=True, default=-1):
""" S x , .
x: int
mode: False "" "" .
"""
if mode:
x+=1
if x>=0:
return self.Fenwick.bisect_left(self.Fenwick.sum(x), default)
else:
return default
def next(self, x, mode=True, default=-1):
""" S x , .
x: int
mode: False "" "" .
"""
if not mode:
x+=1
return self.Fenwick.bisect_right(self.Fenwick.sum(x), default)
def less_count(self, x, mode=False):
""" x .
x: int
mode: mode=True , "" "" .
"""
if mode:
x+=1
return self.Fenwick.sum(x)
def more_count(self, x, mode=False):
""" x .
x: int
mode: mode=True , "" "" .
"""
return len(self)-self.less_count(x, not mode)
def kth_min(self, k, default=-1):
""" k .
"""
if 1<=k<=len(self):
return self[k-1]
else:
return default
def kth_max(self, k, default=-1):
""" k .
"""
if 1<=k<=len(self):
return self[~(k-1)]
else:
return default
#==================================================
def AND(x,y):
return (x and y)
def OR(x,y):
return (x or y)
def XOR(x,y):
return (x^y)
def IMP(x,y):
return ((not x) or y)
#==================================================
def solve():
N=int(input())
X=list(input().split())
Y=[None]+list(input().split())
S=list(map(int,input().split()))
X=[x=="True" for x in X]
U=Ordered_Set(N, S=[1]*N)
left=[i-1 if i>0 else -1 for i in range(N)]
right=[i+1 if i<N-1 else -1 for i in range(N)]
for j in range(N-1):
k=U[S[j]-1]
if Y[right[k]]=="and":
op=AND
elif Y[right[k]]=="or":
op=OR
elif Y[right[k]]=="xor":
op=XOR
else:
op=IMP
U.discard(right[k])
X[k]=op(X[k], X[right[k]])
X[right[k]]=None
right[k]=right[right[k]]
left[right[k]]=k
return X[0]
#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write
T=int(input())
write("\n".join(map(str,[solve() for _ in range(T)])))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0