結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-20 21:25:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 3,330 bytes |
コンパイル時間 | 2,374 ms |
コンパイル使用メモリ | 206,348 KB |
最終ジャッジ日時 | 2025-01-16 02:05:20 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = 1e9 + 7;// const int mod = 998244353;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;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 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}/*** @brief Union-Find* @docs docs/union-find.md*/struct UnionFind {vector< int > data;UnionFind() = default;explicit UnionFind(size_t sz) : data(sz, -1) {}bool unite(int x, int y) {x = find(x), y = find(y);if(x == y) return false;if(data[x] > data[y]) swap(x, y);data[x] += data[y];data[y] = x;return true;}int find(int k) {if(data[k] < 0) return (k);return data[k] = find(data[k]);}int size(int k) {return -data[find(k)];}bool same(int x, int y) {return find(x) == find(y);}};int main() {int N, D, W;cin >> N >> D >> W;UnionFind uf1(N);for(int i = 0; i < D; i++) {int a, b;cin >> a >> b;--a, --b;uf1.unite(a, b);}UnionFind uf2(N);for(int i = 0; i < W; i++) {int a, b;cin >> a >> b;--a, --b;uf2.unite(a, b);}vector< vector< int > > group(N);for(int i = 0; i < N; i++) {group[uf1.find(i)].emplace_back(i);}int64 ret = 0;for(int i = 0; i < N; i++) {if(group[i].empty()) continue;map< int, int > mp;for(auto &p : group[i]) {mp[uf2.find(p)] = uf2.size(p);}int64 sz = group[i].size();for(auto &p : mp) {ret += sz * p.second;}}cout << ret - N << "\n";}