結果
問題 |
No.3131 Twin Slide Puzzles
|
ユーザー |
|
提出日時 | 2025-04-26 01:55:04 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,099 bytes |
コンパイル時間 | 516 ms |
コンパイル使用メモリ | 82,648 KB |
実行使用メモリ | 277,580 KB |
最終ジャッジ日時 | 2025-04-26 01:55:24 |
合計ジャッジ時間 | 19,584 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 WA * 1 |
other | AC * 10 WA * 26 TLE * 1 -- * 20 |
ソースコード
from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, 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): 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): 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()) def inversion(p): n = len(p) uf = UnionFind(n) for i in range(n): uf.union(i, p[i]) return (n - uf.group_count()) % 2 from itertools import permutations n = int(input()) def pri(P): for i in range(n): print(*P[i * n : (i + 1) * n]) N = n * n a = [] for i in range(n): a += list(map(int, input().split())) from collections import defaultdict from random import sample d = defaultdict(lambda : None) p = tuple(range(N)) for _ in range(400): p = sample(p, N) if (inversion(p) - p.index(0)) % 2: continue s = 0 for i in range(N): s += p[i] * a[i] if d[s] == None: d[s] = p elif d[s] != p: P = d[s] Q = p print("Yes") pri(P) pri(Q) break else: print("No")