結果
問題 | No.1390 Get together |
ユーザー | rniya |
提出日時 | 2021-02-12 21:32:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 104 ms / 2,000 ms |
コード長 | 5,045 bytes |
コンパイル時間 | 2,047 ms |
コンパイル使用メモリ | 201,740 KB |
最終ジャッジ日時 | 2025-01-18 18:04:33 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 3 ms
6,820 KB |
testcase_04 | AC | 3 ms
6,820 KB |
testcase_05 | AC | 3 ms
6,816 KB |
testcase_06 | AC | 3 ms
6,824 KB |
testcase_07 | AC | 3 ms
6,820 KB |
testcase_08 | AC | 4 ms
6,816 KB |
testcase_09 | AC | 3 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 1 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,820 KB |
testcase_13 | AC | 1 ms
6,820 KB |
testcase_14 | AC | 2 ms
6,816 KB |
testcase_15 | AC | 1 ms
6,816 KB |
testcase_16 | AC | 73 ms
9,856 KB |
testcase_17 | AC | 102 ms
15,744 KB |
testcase_18 | AC | 49 ms
6,820 KB |
testcase_19 | AC | 93 ms
12,288 KB |
testcase_20 | AC | 98 ms
14,336 KB |
testcase_21 | AC | 104 ms
14,464 KB |
testcase_22 | AC | 80 ms
10,496 KB |
testcase_23 | AC | 81 ms
10,368 KB |
testcase_24 | AC | 77 ms
10,496 KB |
testcase_25 | AC | 104 ms
12,288 KB |
testcase_26 | AC | 98 ms
12,416 KB |
testcase_27 | AC | 103 ms
12,288 KB |
testcase_28 | AC | 98 ms
12,288 KB |
testcase_29 | AC | 101 ms
12,288 KB |
testcase_30 | AC | 97 ms
12,416 KB |
testcase_31 | AC | 98 ms
12,288 KB |
ソースコード
#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(), (x).end()template <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';return os;}template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {for (int i = 0; i < (int)v.size(); i++) {os << v[i] << (i + 1 == (int)v.size() ? "" : " ");}return os;}void debug_out() { cerr << '\n'; }template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) \cerr << " "; \cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \cerr << " "; \debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}#pragma endregion/*** @brief UnionFind* @docs docs/datastructure/UnionFind.md*/struct UnionFind {int num;vector<int> par, rank;UnionFind(int n) : num(n), par(n), rank(n, 1) { iota(par.begin(), par.end(), 0); }int root(int x) { return (par[x] == x ? x : par[x] = root(par[x])); }bool merge(int x, int y) {x = root(x);y = root(y);if (x == y) return false;if (rank[x] < rank[y]) swap(x, y);par[y] = x;rank[x] += rank[y];num--;return true;}bool same(int x, int y) { return root(x) == root(y); }int size(int x) { return rank[root(x)]; }int count() { return num; }int operator[](int x) { return root(x); }};const int INF = 1e9;const long long IINF = 1e18;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const char dir[4] = {'D', 'R', 'U', 'L'};const long long MOD = 1000000007;// const long long MOD = 998244353;int main() {cin.tie(0);ios::sync_with_stdio(false);int N, M;cin >> N >> M;UnionFind UF(N + M);for (int i = 0; i < N; i++) {int b, c;cin >> b >> c;UF.merge(b - 1, M + c - 1);}set<int> s;for (int i = 0; i < M; i++) s.emplace(UF[i]);cout << M - s.size() << '\n';return 0;}