結果

問題 No.2630 Colorful Vertices and Cheapest Paths
ユーザー rlangevinrlangevin
提出日時 2024-02-16 22:06:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,037 ms / 2,500 ms
コード長 2,753 bytes
コンパイル時間 265 ms
コンパイル使用メモリ 82,424 KB
実行使用メモリ 163,352 KB
最終ジャッジ日時 2024-09-28 20:24:41
合計ジャッジ時間 28,628 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 832 ms
99,416 KB
testcase_01 AC 1,635 ms
122,088 KB
testcase_02 AC 1,912 ms
154,680 KB
testcase_03 AC 108 ms
78,800 KB
testcase_04 AC 66 ms
71,700 KB
testcase_05 AC 102 ms
78,932 KB
testcase_06 AC 643 ms
89,112 KB
testcase_07 AC 1,553 ms
159,200 KB
testcase_08 AC 1,530 ms
150,540 KB
testcase_09 AC 1,766 ms
161,208 KB
testcase_10 AC 1,884 ms
162,360 KB
testcase_11 AC 2,003 ms
162,736 KB
testcase_12 AC 1,897 ms
163,272 KB
testcase_13 AC 1,943 ms
162,760 KB
testcase_14 AC 2,037 ms
163,352 KB
testcase_15 AC 685 ms
81,168 KB
testcase_16 AC 669 ms
81,564 KB
testcase_17 AC 680 ms
81,672 KB
testcase_18 AC 966 ms
102,496 KB
testcase_19 AC 1,240 ms
141,848 KB
testcase_20 AC 1,173 ms
129,668 KB
testcase_21 AC 1,371 ms
160,796 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline
#https://github.com/not522/ac-library-python/blob/master/atcoder/dsu.py
import typing


class DSU:
    '''
    Implement (union by size) + (path halving)

    Reference:
    Zvi Galil and Giuseppe F. Italiano,
    Data structures and algorithms for disjoint set union problems
    '''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a: int, b: int) -> int:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        x = self.leader(a)
        y = self.leader(b)

        if x == y:
            return x

        if -self.parent_or_size[x] < -self.parent_or_size[y]:
            x, y = y, x

        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x

        return x

    def same(self, a: int, b: int) -> bool:
        assert 0 <= a < self._n
        assert 0 <= b < self._n

        return self.leader(a) == self.leader(b)

    def leader(self, a: int) -> int:
        assert 0 <= a < self._n

        parent = self.parent_or_size[a]
        while parent >= 0:
            if self.parent_or_size[parent] < 0:
                return parent
            self.parent_or_size[a], a, parent = (
                self.parent_or_size[parent],
                self.parent_or_size[parent],
                self.parent_or_size[self.parent_or_size[parent]]
            )

        return a

    def size(self, a: int) -> int:
        assert 0 <= a < self._n

        return -self.parent_or_size[self.leader(a)]

    def groups(self) -> typing.List[typing.List[int]]:
        leader_buf = [self.leader(i) for i in range(self._n)]

        result: typing.List[typing.List[int]] = [[] for _ in range(self._n)]
        for i in range(self._n):
            result[leader_buf[i]].append(i)

        return list(filter(lambda r: r, result))

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 = [DSU(N) for _ in range(K)]
cost = [0] * K
for s in range(K):
    for a, b in zip(A, B):
        if ((s >> C[a]) & 1) and ((s >> C[b]) & 1):
            U[s].merge(a, b)
    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
    if not U[-1].same(u, v):
        print(-1)
        continue
    
    for i in range(K):
        if U[i].same(u, v):
            ans = min(ans, cost[i])
         
    print(ans) if ans != inf else print(-1)
0