結果
問題 | No.1390 Get together |
ユーザー | nrvft |
提出日時 | 2021-02-12 21:35:12 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 92 ms / 2,000 ms |
コード長 | 3,084 bytes |
コンパイル時間 | 2,178 ms |
コンパイル使用メモリ | 206,624 KB |
実行使用メモリ | 14,400 KB |
最終ジャッジ日時 | 2023-09-27 03:09:49 |
合計ジャッジ時間 | 5,278 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 3 ms
4,376 KB |
testcase_04 | AC | 3 ms
4,376 KB |
testcase_05 | AC | 3 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 48 ms
12,076 KB |
testcase_17 | AC | 83 ms
14,252 KB |
testcase_18 | AC | 50 ms
12,160 KB |
testcase_19 | AC | 89 ms
14,240 KB |
testcase_20 | AC | 90 ms
14,180 KB |
testcase_21 | AC | 91 ms
14,232 KB |
testcase_22 | AC | 70 ms
13,212 KB |
testcase_23 | AC | 72 ms
13,264 KB |
testcase_24 | AC | 72 ms
13,220 KB |
testcase_25 | AC | 92 ms
14,400 KB |
testcase_26 | AC | 88 ms
14,156 KB |
testcase_27 | AC | 89 ms
14,344 KB |
testcase_28 | AC | 88 ms
14,312 KB |
testcase_29 | AC | 89 ms
14,280 KB |
testcase_30 | AC | 85 ms
14,312 KB |
testcase_31 | AC | 89 ms
14,236 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using vl = vector<ll>; template<class T> using vc = vector<T>; template<class T> using vvc = vector<vector<T>>; #define eb emplace_back #define all(x) (x).begin(), (x).end() #define rep(i, n) for (ll i = 0; i < (n); i++) #define repr(i, n) for (ll i = (n)-1; i >= 0; i--) #define repe(i, l, r) for (ll i = (l); i < (r); i++) #define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--) #define repa(i,n) for (auto& i: n) template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;} template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;} struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_; #ifdef DEBUG template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; } template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; } template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; } template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; } ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; } template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); } #endif const ll INF = 4e18; const ld EPS = 1e-11; const ld PI = acos(-1.0L); const ll MOD = 1e9 + 7; // const ll MOD = 998244353; //--------------------------------------------------------------------------------// struct UnionFind { private: vector<int> par; vector<int> count; vector<int> rank; public: UnionFind(int N) { count.assign(N, 1); rank.assign(N, 0); par.assign(N, 0); rep(i, N) par[i] = i; } int root(int x) { if (par[x] == x) return x; else { par[x] = root(par[x]); return par[x]; } } void unite(int x, int y) { x = root(x), y = root(y); if (x == y) return; if (rank[x] < rank[y]) swap(x, y); else if (rank[x] == rank[y]) rank[y]++; par[y] = x; count[x] += count[y]; return; } int size(int x) { return count[root(x)]; } bool issame(int x, int y) { return root(x) == root(y); } }; using UF = struct UnionFind; int main() { ll N, M; cin >> N >> M; UF uf(M); vvc<ll> B(N); rep(i, N){ ll b, c; cin >> b >> c, b--, c--; B[c].eb(b); } ll ans = 0; rep(i, N){ if (B[i].size() <= 1) continue; ll a = B[i][0]; repe(j, 1, B[i].size()){ if (uf.issame(a, B[i][j])) continue; uf.unite(a, B[i][j]); ans++; } } cout << ans << endl; }