結果
問題 | No.1390 Get together |
ユーザー |
|
提出日時 | 2021-03-19 19:45:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,790 bytes |
コンパイル時間 | 2,287 ms |
コンパイル使用メモリ | 199,248 KB |
最終ジャッジ日時 | 2025-01-19 18:12:34 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
#include<bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REPR(i, n) for (int i = n - 1; i >= 0; --i)#define FOR(i, m, n) for (int i = m; i < n; ++i)#define FORR(i, m, n) for (int i = m; i >= n; --i)#define ALL(v) (v).begin(),(v).end()template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }const ll INF=1LL<<60;const int inf=(1<<30)-1;const int mod=998244353;int dx[8]={1,0,-1,0,-1,-1,1,1};int dy[8]={0,1,0,-1,-1,1,-1,1};struct dsu {public:dsu() : _n(0) {}dsu(int n) : _n(n), parent_or_size(n, -1) {}int merge(int a, int b) {assert(0 <= a && a < _n);assert(0 <= b && b < _n);int x = leader(a), y = leader(b);if (x == y) return x;if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);parent_or_size[x] += parent_or_size[y];parent_or_size[y] = x;return x;}bool same(int a, int b) {assert(0 <= a && a < _n);assert(0 <= b && b < _n);return leader(a) == leader(b);}int leader(int a) {assert(0 <= a && a < _n);if (parent_or_size[a] < 0) return a;return parent_or_size[a] = leader(parent_or_size[a]);}int size(int a) {assert(0 <= a && a < _n);return -parent_or_size[leader(a)];}std::vector<std::vector<int>> groups() {std::vector<int> leader_buf(_n), group_size(_n);for (int i = 0; i < _n; i++) {leader_buf[i] = leader(i);group_size[leader_buf[i]]++;}std::vector<std::vector<int>> result(_n);for (int i = 0; i < _n; i++) {result[i].reserve(group_size[i]);}for (int i = 0; i < _n; i++) {result[leader_buf[i]].push_back(i);}result.erase(std::remove_if(result.begin(), result.end(),[&](const std::vector<int>& v) { return v.empty(); }),result.end());return result;}private:int _n;// root node: -1 * component size// otherwise: parentstd::vector<int> parent_or_size;};int main(){cin.tie(0);ios::sync_with_stdio(false);int n,m;cin >> n >> m;vector<vector<int>> a(n);REP(i,n){int b,c;cin >> b >> c;b--,c--;a[c].push_back(b);}dsu uf(m);REP(i,n){if(a[i].size()<2) continue;REP(j,a[i].size()-1){uf.merge(a[i][j],a[i][j+1]);}}int ans=0;REP(i,m){if(uf.leader(i)==i) ans+=uf.size(i)-1;}cout << ans << endl;}