#934657 (PyPy3) No.2563 色ごとのグループ

• 問題: No.2563 色ごとのグループ
• ユーザー: とろちゃ
• 提出日時: 2023-12-02 15:39:45
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 689 ms / 2,000 ms
• コード長: 1,993 bytes
• コンパイル時間: 316 ms
• コンパイル使用メモリ: 82,196 KB
• 実行使用メモリ: 199,980 KB
• 最終ジャッジ日時: 2024-09-26 19:06:36
• 合計ジャッジ時間: 11,367 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

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

ソースコード

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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
# import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
import os
import sys
# from bisect import *
from collections import *
# from datetime import *
# from decimal import *  # PyPyだと遅い
# from heapq import *
# from itertools import *
# from math import gcd, lcm
# from random import *
# from string import *
# import numpy as np
# from atcoder.dsu import *
# from atcoder.segtree import *
# from more_itertools import *
# from sortedcontainers import *
# sys.setrecursionlimit(10**7)  # PyPyは呪文を付ける
# sys.set_int_max_str_digits(0)
INF = 1 << 61
MOD = 998244353
# MOD = 10**9 + 7
IS_ATCODER = os.getenv("ATCODER", 0)
File = sys.stdin
def input():
    return File.readline().replace("\n", "")
# ///////////////////////////////////////////////////////////////////////////
def bfs(G, start):
    """
    グラフで幅優先探索をする関数
    seenを集合、distを辞書で管理
    配列で管理するより遅め
    引数:
    G (defaultdict): グラフ
    start (int): 始点
    戻り値:
    dist (dict): 始点からの距離
    """
    que = deque()
    dist = {}
    global seen
    que.append(start)
    seen.add(start)
    dist[start] = 0
    while que:
        for _ in range(len(que)):
            pop = que.popleft()
            for i in G[pop]:
                if i not in seen and C[i] == C[pop]:
                    seen.add(i)
                    dist[i] = dist.get(pop, 0) + 1
                    que.append(i)
    return dist
N, M = map(int, input().split())
C = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
G = [set() for _ in range(N)]
for i, j in edges:
    G[i - 1].add(j - 1)
    G[j - 1].add(i - 1)
color = defaultdict(list)
for i, j in enumerate(C):
    color[j].append(i)
ans = 0
for i in color.keys():
    seen = set()
    c = 0
    for j in color[i]:
        if j in seen:
            continue
        c += 1
        bfs(G, j)
    ans += c - 1
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX