結果
問題 | No.1390 Get together |
ユーザー |
![]() |
提出日時 | 2021-02-13 17:31:53 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 175 ms / 2,000 ms |
コード長 | 2,904 bytes |
コンパイル時間 | 3,547 ms |
コンパイル使用メモリ | 204,096 KB |
最終ジャッジ日時 | 2025-01-18 20:09:30 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 29 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using pii = pair<int, int>;template <class T>using V = vector<T>;template <class T>using VV = V<V<T>>;#define pb push_back#define eb emplace_back#define mp make_pair#define fi first#define se second#define rep(i, n) rep2(i, 0, n)#define rep2(i, m, n) for (int i = m; i < (n); i++)#define per(i, b) per2(i, 0, b)#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)#define ALL(c) (c).begin(), (c).end()#define SZ(x) ((int)(x).size())constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }template <class T, class U>void chmin(T& t, const U& u) {if (t > u) t = u;}template <class T, class U>void chmax(T& t, const U& u) {if (t < u) t = u;}template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {os << "(" << p.first << "," << p.second << ")";return os;}template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {os << "{";rep(i, v.size()) {if (i) os << ",";os << v[i];}os << "}";return os;}#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << H;debug_out(T...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifclass unionfind {vector<int> par, rank;public:void init(int n) {par.resize(n);rank.resize(n);for (int i = 0; i < n; i++) {par[i] = i;rank[i] = 0;}}int find(int x) {if (par[x] == x)return x;elsereturn par[x] = find(par[x]);}void unite(int x, int y) {x = find(x);y = find(y);if (x == y) return;if (rank[x] < rank[y])par[x] = y;else {par[y] = x;if (rank[x] == rank[y]) ++rank[x];}}bool same(int x, int y) { return (find(x) == find(y)); }};int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int N, M;cin >> N >> M;unionfind uf;uf.init(N);VV<int> box(M);rep(i, N) {int b, c;cin >> b >> c;--b, --c;box[b].pb(c);}rep(i, M) {rep(j, SZ(box[i]) - 1) {int a = box[i][j], b = box[i][j + 1];uf.unite(a, b);}}V<set<int>> pos(N);rep(i, M) {for (int c : box[i]) {pos[uf.find(c)].insert(i);}}int ans = 0;rep(i, N) {if (SZ(pos[i]) > 0) {ans += SZ(pos[i]) - 1;}}cout << ans << endl;return 0;}