結果
問題 | No.2630 Colorful Vertices and Cheapest Paths |
ユーザー |
|
提出日時 | 2024-02-16 22:37:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 941 ms / 2,500 ms |
コード長 | 1,880 bytes |
コンパイル時間 | 362 ms |
コンパイル使用メモリ | 82,492 KB |
実行使用メモリ | 84,028 KB |
最終ジャッジ日時 | 2024-09-28 21:12:42 |
合計ジャッジ時間 | 14,512 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 22 |
ソースコード
import sys sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd from collections import defaultdict class UnionFind: def __init__(self, n): self.n = n self.p = [-1] * (n+1) def find(self, x): if self.p[x] < 0: return x else: self.p[x] = self.find(self.p[x]) return self.p[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.p[x] > self.p[y]: x, y = y, x self.p[x] += self.p[y] self.p[y] = x def same(self, a, b): return self.find(a) == self.find(b) def group(self): d = defaultdict(list) for i in range(1, self.n+1): par = self.find(i) d[par].append(i) return d n,m = map(int,input().split()) colpair = [[[] for i in range(10)] for i in range(10)] e = [list(map(int,input().split())) for i in range(m)] c = list(map(int,input().split())) w = list(map(int,input().split())) c = [i-1 for i in c] for i in range(m): u, v= e[i] colpair[c[u-1]][c[v-1]].append(i) q = int(input()) qs = [list(map(int,input().split())) for i in range(q)] ans = [10**15]*q for bit in range(1<<10): use = [] cost = 0 uf = UnionFind(n) for i in range(10): if (bit>>i) & 1: use.append(i) cost += w[i] for c1 in use: for c2 in use: for i in colpair[c1][c2]: u,v = e[i] uf.union(u,v) for i in range(q): u,v = qs[i] if uf.same(u,v): ans[i] = min(ans[i], cost) for i in ans: if i == 10**15: print(-1) else: print(i)