結果

問題 No.1779 Magical Swap
ユーザー NoneNone
提出日時 2022-01-26 06:00:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 346 ms / 2,000 ms
コード長 2,832 bytes
コンパイル時間 205 ms
コンパイル使用メモリ 82,476 KB
実行使用メモリ 102,352 KB
最終ジャッジ日時 2024-12-21 07:52:35
合計ジャッジ時間 5,542 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
""" (x)"""
tmp = []
parents = self.parents
while parents[x] >= 0:
tmp.append(x)
x = parents[x]
for y in tmp:
parents[y] = x
return x
def union(self, x, 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 same(self, x, y):
""" xy """
return self.find(x) == self.find(y)
def size(self, x):
""" xparent(= ) """
return -self.parents[self.find(x)]
def members(self, x):
""" x O(N)"""
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
""" O(N)"""
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
""" O(N)"""
return len(self.roots())
def size_list(self):
""" () O(N)"""
return [-x for x in self.parents if x < 0]
def all_group_members(self):
""" {:[()],...} O(N)"""
res = [[] for _ in range(self.n)]
for i in range(self.n):
x = self.find(i)
res[x].append(i)
return {r: res[r] for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
##############################################################################################################
import sys
input = sys.stdin.readline
T=int(input())
for _ in range(T):
N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
U = UnionFind(N)
for k in range(2,N+1):
for i in range(1,N+1):
if (i+1)*k>N:
break
U.union(i*k-1,(i+1)*k-1)
for _,p in U.all_group_members().items():
AA=[]
BB=[]
for i in p:
AA.append(A[i])
BB.append(B[i])
AA.sort()
BB.sort()
if AA!=BB:
print("No")
break
else:
print("Yes")
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0