結果
問題 | No.1779 Magical Swap |
ユーザー | Shirotsume |
提出日時 | 2021-12-08 00:21:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,541 bytes |
コンパイル時間 | 458 ms |
コンパイル使用メモリ | 86,800 KB |
実行使用メモリ | 108,404 KB |
最終ジャッジ日時 | 2023-09-23 07:48:02 |
合計ジャッジ時間 | 4,573 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
71,688 KB |
testcase_01 | AC | 96 ms
71,428 KB |
testcase_02 | AC | 198 ms
79,356 KB |
testcase_03 | AC | 130 ms
78,392 KB |
testcase_04 | AC | 138 ms
103,752 KB |
testcase_05 | AC | 114 ms
85,848 KB |
testcase_06 | AC | 115 ms
87,512 KB |
testcase_07 | AC | 131 ms
99,912 KB |
testcase_08 | AC | 103 ms
76,652 KB |
testcase_09 | AC | 162 ms
82,256 KB |
testcase_10 | AC | 247 ms
106,012 KB |
testcase_11 | AC | 191 ms
90,776 KB |
testcase_12 | AC | 154 ms
79,336 KB |
testcase_13 | AC | 221 ms
98,356 KB |
testcase_14 | AC | 258 ms
106,924 KB |
testcase_15 | AC | 217 ms
79,148 KB |
testcase_16 | AC | 143 ms
108,404 KB |
testcase_17 | AC | 225 ms
78,464 KB |
testcase_18 | AC | 100 ms
71,460 KB |
ソースコード
import sys from collections import Counter input = lambda: sys.stdin.readline().rstrip() INF = 10 ** 19 from math import gcd class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return x if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return x def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 def solve(): n = int(input()) a = [0] + list(map(int,input().split())) b = [0] + list(map(int,input().split())) if a[1] != b[1]: return 'No' now = 1 ans = 'Yes' U = dsu(n + 1) for i in range(2,n + 1): for j in range(i, n + 1, i): U.merge(i, j) a_now = [[] for _ in range(n + 1)] b_now = [[] for _ in range(n + 1)] for i in range(2, n + 1): a_now[U.leader(i)].append(a[i]) b_now[U.leader(i)].append(b[i]) for i in range(n): a_now[i].sort() b_now[i].sort() if a_now[i] != b_now[i]: ans = 'No' break return ans t = int(input()) for _ in range(t): print(solve())