#782865 (PyPy3) No.860 買い物

• 問題: No.860 買い物
• ユーザー: stng
• 提出日時: 2022-07-30 13:09:36
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 898 ms / 1,000 ms
• コード長: 1,396 bytes
• コンパイル時間: 144 ms
• コンパイル使用メモリ: 82,560 KB
• 実行使用メモリ: 127,040 KB
• 最終ジャッジ日時: 2024-07-20 09:47:00
• 合計ジャッジ時間: 8,869 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

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

ソースコード

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
import heapq
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 = int(input())
cd = [[int(i) for i in input().split()] for j in range(n)]
c = []
#d = []
ans = 0
for i in range(n):
    c.append([cd[i][0],n,i])
    if i != 0:
        c.append([cd[i][1],0,i-1])
    ans += cd[i][0]
ki = UnionFind(n+1)
c.sort()
#print(c)
for i in range(2*n-1):
    cost,tmp,v = c[i]
    if tmp == n:
        if not ki.same_check(n,v):
            ki.union(n,v)
            ans += cost
            #print(v,cost)
    else:
        if not ki.same_check(v,v+1):
            ki.union(v+1,v)
            ans += cost
            #print(v,cost)
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX