#616544 (C++11（廃止可能性あり）) No.1390 Get together

• 問題: No.1390 Get together
• ユーザー: leaf_1415
• 提出日時: 2021-02-12 21:27:32
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: AC
• 実行時間: 81 ms / 2,000 ms
• コード長: 2,108 bytes
• コンパイル時間: 817 ms
• コンパイル使用メモリ: 90,124 KB
• 実行使用メモリ: 18,324 KB
• 最終ジャッジ日時: 2024-07-19 20:15:19
• 合計ジャッジ時間: 3,451 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
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
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
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define outl(x) cout << x << endl
#define SP << " " << 
#define inf 1e18
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;
struct UnionFind{
    int size;
    vector<int> parent;
    vector<int> rank;
    vector<int> v, e;
    
    UnionFind(){}
    UnionFind(int size){
        this->size = size;
        parent.resize(size+1);
        rank.resize(size+1);
        v.resize(size+1);
        e.resize(size+1);
        init();
    }
    void init(){
        for(int i = 0; i <= size; i++){
            parent[i] = i, rank[i] = 0;
            v[i] = 1, e[i] = 0;
        }
    }
    int root(int i){
        if(parent[i] == i) return i;
        return parent[i] = root(parent[i]);
    }
    bool same(int i, int j){
        return root(i) == root(j);
    }
    void merge(int i, int j){ // j will become new root
        parent[i] = j;
        v[j] += v[i];
        e[j] += e[i] + 1;
    }
    void unite(int i, int j){
        int root_i = root(i), root_j = root(j);
        if(root_i == root_j){
            e[root_i]++;
            return;
        }
        if(rank[root_i] < rank[root_j]) merge(root_i, root_j);
        else merge(root_j, root_i);
        if(rank[root_i] == rank[root_j]) rank[root_i]++;
    }
};
ll n, m;
ll b[200005], c[200005];
vector<ll> vec[200005];
UnionFind uf(200005);
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m;
    rep(i, 1, n) cin >> b[i] >> c[i];
    
    rep(i, 1, n) vec[c[i]].push_back(b[i]);
    ll ans = 0;
    rep(i, 1, n){
        sort(all(vec[i]));
        if(vec[i].size() <= 1) continue;
        
        rep(j, 1, (int)vec[i].size()-1){
            ll u = vec[i][j-1], v = vec[i][j];
            if(!uf.same(u, v)) ans++, uf.unite(u, v);
        }
    }
    cout << ans << endl;
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX