結果
問題 | No.3093 Safe Infection |
ユーザー |
|
提出日時 | 2025-04-06 16:29:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 441 ms / 2,000 ms |
コード長 | 2,190 bytes |
コンパイル時間 | 377 ms |
コンパイル使用メモリ | 82,848 KB |
実行使用メモリ | 109,956 KB |
最終ジャッジ日時 | 2025-04-06 16:29:59 |
合計ジャッジ時間 | 19,064 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 70 |
ソースコード
import sys input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n self.a = [-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.a[x] = max(self.a[x], self.a[y]) 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()) n, m, k = na() a = na() uf = UnionFind(n) for i in range(n): uf.a[i] = a[i] g = [[] for i in range(n)] e = [] for _ in range(m): x, y = na() x -= 1 y -= 1 g[x].append(y) g[y].append(x) e.append((max(a[x], a[y]), x, y)) dp = [a[i] for i in range(n)] for c, i, j in sorted(e): i = uf.find(i) j = uf.find(j) if abs(uf.a[i] - uf.a[j]) <= k: uf.union(i, j) if uf.group_count() == 1: Yes() else: No()