#934398 (D) No.2563 色ごとのグループ

• 問題: No.2563 色ごとのグループ
• ユーザー: InTheBloom
• 提出日時: 2023-12-02 15:16:30
• 言語: D (dmd 2.109.1)
• 結果: AC
• 実行時間: 734 ms / 2,000 ms
• コード長: 2,603 bytes
• コンパイル時間: 4,635 ms
• コンパイル使用メモリ: 173,444 KB
• 実行使用メモリ: 125,600 KB
• 最終ジャッジ日時: 2024-09-26 18:21:57
• 合計ジャッジ時間: 13,800 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
import std;
void main () {
    /*
       色ごとの全域木をつくるかんじで
       辞書型UFでずるする
     */
    int N, M; readln.read(N, M);
    int[] C = readln.split.to!(int[]);
    alias UFarr = UnionFind_Dictionary!(int);
    UFarr[int] UF;
    foreach (c; C) UF[c] = UnionFind_Any!(int);
    // 登録
    foreach (i, c; C) UF[c].addElement(cast(int) i);
    foreach (i; 0..M) {
        int u, v; readln.read(u, v);
        u--, v--;
        if (C[u] == C[v]) {
            UF[C[u]].unite(u, v);
        }
    }
    int ans = 0;
    foreach (U; UF) {
        ans += U.countGroups-1;
    }
    writeln(ans);
}
void read (T...) (string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}
class UnionFind_Dictionary (T) {
    private:
        T[T] parent;
        int[T] size;
    T root (T x) {
        if (x !in parent) {
            addElement(x);
            return x;
        }
        if (parent[x] == x) return x;
        return parent[x] = root(parent[x]);
    }
    bool same (T x, T y) {
        return root(x) == root(y);
    }
    void unite (T x, T y) {
        addElement(x), addElement(y);
        T larger, smaller;
        if (GroupSize(x) <= GroupSize(y)) {
            larger = root(y);
            smaller = root(x);
        } else {
            larger = root(x);
            smaller = root(y);
        }
        if (larger == smaller) return;
        parent[smaller] = larger;
        size[larger] += size[smaller];
    }
    int countGroups () {
        int res = 0;
        foreach (key, val; parent) {
            if (root(key) == key) res++;
        }
        return res;
    }
    bool addElement (T x) {
        if (x in parent) return false;
        parent[x] = x;
        size[x] = 1;
        return true;
    }
    int GroupSize (T x) {
        addElement(x);
        return size[root(x)];
    }
    T[][] enumGroups (T x) {
        T[][T] mp;
        T[][] res;
        foreach (key, val; parent) {
            mp[root(key)] ~= key;
        }
        foreach (val; mp) {
            res ~= val;
        }
        return res;
    }
    void reset () {
        parent.clear;
        size.clear;
    }
}
auto UnionFind_Any (T) () {
    return new UnionFind_Dictionary!(T)();
}
import std.range.primitives : isInputRange;
auto UnionFind_Any (T, E) (E range) if (isInputRange!(E) || is(T == S[], S) || is(T == S[n], S, size_t n)) {
    auto res = new UnionFind_Dictionary!(T)();
    foreach (elem; range) {
        res.addElement(elem);
    }
    return res;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX