#616665 (C++17) No.1390 Get together

• 問題: No.1390 Get together
• ユーザー: bayashiko
• 提出日時: 2021-02-12 21:39:58
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 75 ms / 2,000 ms
• コード長: 2,253 bytes
• コンパイル時間: 2,805 ms
• コンパイル使用メモリ: 223,124 KB
• 最終ジャッジ日時: 2025-01-18 18:09:47
• ジャッジサーバー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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
//#include<atcoder/all>
//using namespace atcoder;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
//typedef __int128_t llint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
//vector<int> bucket[MAX_N/1000];
constexpr int MOD=1000000007;
//constexpr int MOD=998244353;
vector<lint> par; //MAX_N
vector<lint> ufsize; //MAX_N
vector<map<int,int>> group;
 
void init(lint x){
    par.resize(x);
    ufsize.resize(x);
    group.resize(x);
    rep(i,x) par[i]=i,ufsize[i]=1;
}
 
lint root(lint x){
    if(par[x]==x) return x;
    else return par[x]=root(par[x]);
}
 
bool same(lint x,lint y){
    return root(x)==root(y);
}
 
void unite(lint x,lint y){
    x=root(x);
    y=root(y);
    if(x==y) return;
    if(ufsize[x]>ufsize[y]){
        par[y]=x;
        for(const auto &mp:group[y]) group[x][mp.fi]+=mp.se;
    }
    else{
        par[x]=y;
        for(const auto &mp:group[x]) group[y][mp.fi]+=mp.se;
    }
    lint s=ufsize[x]+ufsize[y];
    ufsize[x]=s,ufsize[y]=s;
}
 
lint size(lint x){
    return ufsize[root(x)];
}
int main(void){
    int N,M;
    cin >> N >> M;
    init(M);
    int plc[N];
    rep(i,N) plc[i]=-1;
    rep(i,N){
        int b,c;
        cin >> b >> c;
        b--,c--;
        if(plc[c]==-1) plc[c]=b;
        else unite(plc[c],b);
    }
    lint ans=0;
    rep(i,M) if(root(i)==i) ans+=size(i)-1;
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX