結果
問題 |
No.2630 Colorful Vertices and Cheapest Paths
|
ユーザー |
![]() |
提出日時 | 2024-02-16 21:54:29 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,698 bytes |
コンパイル時間 | 251 ms |
コンパイル使用メモリ | 82,376 KB |
実行使用メモリ | 246,348 KB |
最終ジャッジ日時 | 2024-09-28 20:09:49 |
合計ジャッジ時間 | 20,704 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 5 TLE * 5 -- * 12 |
ソースコード
import sys input = sys.stdin.readline class UnionFind(): def __init__(self, N): self._par = [-1] * N self._size = [1] * N def find(self, x): if self._par[x] == x: return x else: vertices = [] while self._par[x] >= 0: vertices.append(x) x = self._par[x] for i in vertices: self._par[i] = x return x def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self._size[x] < self._size[y]: x, y = y, x self._par[y] = x self._size[x] += self._size[y] def is_same(self, x, y): return self.find(x) == self.find(y) def get_size(self, x): x = self.find(x) return self._size[x] N, M = map(int, input().split()) A, B = [-1] * M, [-1] * M for i in range(M): A[i], B[i] = map(int, input().split()) A[i], B[i] = A[i] - 1, B[i] - 1 C = list(map(int, input().split())) for i in range(N): C[i] -= 1 W = list(map(int, input().split())) K = 1 << 10 U = [UnionFind(N) for _ in range(K)] cost = [0] * K for s in range(K): for i in range(M): if ((s >> C[A[i]]) & 1) and ((s >> C[B[i]]) & 1): U[s].union(A[i], B[i]) for i in range(10): if (s >> i) & 1: cost[s] += W[i] Q = int(input()) inf = 10 ** 18 for _ in range(Q): ans = inf u, v = map(int, input().split()) u, v = u - 1, v - 1 for i in range(K): if U[i].is_same(u, v): ans = min(ans, cost[i]) print(ans) if ans != inf else print(-1)