結果

問題 No.2308 [Cherry 5th Tune B] もしかして、真?
ユーザー lloyzlloyz
提出日時 2023-05-19 22:43:10
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,745 bytes
コンパイル時間 330 ms
コンパイル使用メモリ 82,352 KB
実行使用メモリ 138,448 KB
最終ジャッジ日時 2024-12-20 01:13:11
合計ジャッジ時間 24,452 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 15 WA * 24
権限があれば一括ダウンロードができます

ソースコード

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

from collections import defaultdict
class UnionFind():
def __init__(self, n):
'''
UnionFindn
'''
self.n = n
self.parents = [-1] * n
def find(self, x):
'''
x
'''
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
'''
xy
y
'''
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
'''
x
'''
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
for _ in range(int(input())):
n = int(input())
P = list(input().split())
OP = list(input().split())
X = list(map(int, input().split()))
UF = UnionFind(n)
for i in range(n - 1):
idx = X[i]
op = OP[idx - 1]
i, j = UF.find(idx - 1), UF.find(idx)
s, t = P[i], P[j]
if op == 'and':
if s == 'True' and t == 'True':
res = 'True'
else:
res = 'False'
elif op == 'or':
if s == 'True' or t == 'True':
res = 'True'
else:
res = 'False'
elif op == 'xor':
if s != t:
res = 'True'
else:
res = 'False'
elif op == 'imp':
if s == 'True':
res = t
else:
res = 'True'
UF.union(i, j)
r = UF.find(i)
P[i] = res
print(P[UF.find(0)])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0