結果
問題 | No.3093 Safe Infection |
ユーザー |
|
提出日時 | 2025-04-06 16:46:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 463 ms / 2,000 ms |
コード長 | 2,300 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 82,640 KB |
実行使用メモリ | 104,368 KB |
最終ジャッジ日時 | 2025-04-06 16:46:40 |
合計ジャッジ時間 | 19,162 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 70 |
ソースコード
import collections 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 = collections.defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return ''.join(f'{r}: {m}' for r, m in self.all_group_members().items()) import sys input = sys.stdin.readline n,m,k = map(int,input().split()) a = list(map(int,input().split())) edge = [[] for i in range(n)] e = [] for i in range(m): u,v = map(int,input().split()) u-=1 v-=1 edge[u].append(v) edge[v].append(u) e.append((max(a[u],a[v]),u,v)) e.sort() uf = UnionFind(n) for x,i,j in e: if abs(a[uf.find(i)]-a[uf.find(j)]) <= k: z = max(a[uf.find(i)],a[uf.find(j)]) uf.union(i,j) #print(i,j,a[uf.find(i)],a[uf.find(j)],z) a[uf.find(i)] = z #print(x,i,j,a[uf.find(i)],a[uf.find(j)],uf,a) print('Yes' if uf.size(0) == n else 'No') exit() b = [(a[i],i) for i in range(n)] b.sort() uf = UnionFind(n) for x,i in b: c = [] for j in edge[i]: c.append((a[uf.find(j)],j)) c.sort() for w,j in c: p,q = uf.find(j),uf.find(i) if abs(a[p] - a[q]) <= k: uf.union(p,q) z = max(a[p],a[q]) #a[uf.find(p)] = z print('Yes' if uf.size(0) == n else 'No')