#768532 (PyPy3) No.748 yuki国のお財布事情

• 問題: No.748 yuki国のお財布事情
• ユーザー: stng
• 提出日時: 2022-06-05 19:35:28
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 542 ms / 2,000 ms
• コード長: 1,412 bytes
• コンパイル時間: 230 ms
• コンパイル使用メモリ: 81,780 KB
• 実行使用メモリ: 110,248 KB
• 最終ジャッジ日時: 2024-09-21 04:15:09
• 合計ジャッジ時間: 7,352 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 26

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
class UnionFind:
    def __init__(self, n):
        self.par = [i for i in range(n+1)]
        self.rank = [0] * (n+1)
        self.size = [1 for _ in range(n+1)]
    # 検索
    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]
    # 併合
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
            self.size[y] += self.size[x]
        else:
            self.par[y] = x
            self.size[x] += self.size[y]
        if self.rank[x] == self.rank[y]:
            self.rank[x] += 1
    # 同じ集合に属するか判定
    def same_check(self, x, y):
        return self.find(x) == self.find(y)
n,m,k = map(int,input().split())
li = []
ab = [[] for i in range(n)]
for i in range(m):
    a,b,c = map(int,input().split())
    a -= 1
    b -= 1
    li.append([a,b,c,i])
    #ab[a].append([b,c])
    #[b].append([a,c])
e = [int(input())-1 for i in range(k)]
ki = UnionFind(n+1)
for i in range(k):
    a,b,c,idx = li[e[i]]
    ki.union(a,b)
e = set(e)
li.sort(key=lambda x:(x[2]))
#print(li)
ans = 0
for i in range(m):
    if li[i][3] in e:
        continue
    a,b,c,idx = li[i]
    if not ki.same_check(a,b):
        ki.union(a,b)
    else:
        ans += c
        #print(i,ans)
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX