#1054936 (PyPy3) No.1390 Get together

• 問題: No.1390 Get together
• ユーザー: lam6er
• 提出日時: 2025-03-20 18:51:35
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 572 ms / 2,000 ms
• コード長: 1,847 bytes
• コンパイル時間: 174 ms
• コンパイル使用メモリ: 82,760 KB
• 実行使用メモリ: 184,028 KB
• 最終ジャッジ日時: 2025-03-20 18:53:00
• 合計ジャッジ時間: 10,875 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

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

ソースコード

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
65
66
67
68
69
70
71
import sys
from collections import defaultdict
class UnionFind:
    def __init__(self, size):
        self.parent = list(range(size + 1))  # 1-based indexing
        self.rank = [0] * (size + 1)
    
    def find(self, x):
        if self.parent[x] != x:
            self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    
    def union(self, x, y):
        x_root = self.find(x)
        y_root = self.find(y)
        if x_root == y_root:
            return
        if self.rank[x_root] < self.rank[y_root]:
            self.parent[x_root] = y_root
        else:
            self.parent[y_root] = x_root
            if self.rank[x_root] == self.rank[y_root]:
                self.rank[x_root] += 1
def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    M = int(input[ptr])
    ptr += 1
    
    color_b = defaultdict(set)  # color c -> set of boxes
    box_c = defaultdict(set)    # box b -> set of colors
    
    for _ in range(N):
        b = int(input[ptr])
        ptr += 1
        c = int(input[ptr])
        ptr += 1
        color_b[c].add(b)
        box_c[b].add(c)
    
    # Initialize Union-Find for colors up to N
    uf = UnionFind(N)
    
    # Connect all colors within the same box
    for b in box_c:
        colors = list(box_c[b])
        if len(colors) < 2:
            continue
        root = colors[0]
        for c in colors[1:]:
            uf.union(root, c)
    
    # Count the number of boxes per group
    counter = defaultdict(int)
    for b in box_c:
        colors = box_c[b]
        # Get any color in the box and find its root
        c = next(iter(colors))
        root = uf.find(c)
        counter[root] += 1
    
    # Calculate the answer
    ans = sum(k - 1 for k in counter.values())
    print(ans)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX