結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-20 21:39:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 6,313 bytes |
コンパイル時間 | 2,604 ms |
コンパイル使用メモリ | 209,584 KB |
最終ジャッジ日時 | 2025-01-16 02:11:17 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
// >>> TEMPLATES#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;#define int ll#define double ld#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)#define loop(i,a,B) for (int i = a; i B; i++)#define loopR(i,a,B) for (int i = a; i B; i--)#define all(x) begin(x), end(x)#define allR(x) rbegin(x), rend(x)#define rng(x,l,r) begin(x) + (l), begin(x) + (r)#define pb push_back#define eb emplace_back#define mp make_pair#define fst first#define snd secondtemplate <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;auto constexpr INF32 = inf<int32_t>;auto constexpr INF64 = inf<int64_t>;auto constexpr INF = inf<int>;#ifdef LOCAL#include "debug.hpp"#else#define dump(...) (void)(0)#define say(x) (void)(0)#define debug if (0)#endiftemplate <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {vector<T> &data() { return this->c; }void clear() { this->c.clear(); }};template <class T> using pque_max = pque<T, less<T>>;template <class T> using pque_min = pque<T, greater<T>>;template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << p.first << " " << p.second; }template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;template <class F> struct FixPoint : private F {constexpr FixPoint(F&& f) : F(forward<F>(f)) {}template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }};struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };#define MFP MakeFixPoint()|#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)template <class T, size_t d> struct vec_impl {using type = vector<typename vec_impl<T,d-1>::type>;template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }};template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }template <class T> void quit(T const& x) { cout << x << endl; exit(0); }template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }template <class T> int sz(T const& x) { return x.size(); }template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }const int dx[] = { 1,0,-1,0,1,-1,-1,1 };const int dy[] = { 0,1,0,-1,1,1,-1,-1 };constexpr int popcnt(ll x) { return __builtin_popcountll(x); }// [a,b]template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }// <<<// >>> union findstruct UnionFind {int n, sz; // id : 0...n-1vector<int32_t> par;UnionFind(int n = 0) : n(n), sz(n), par(n,-1) { }void clear() {rep (i,n) par[i] = -1;sz = n;}int root(int x) {assert(0 <= x); assert(x < n);return par[x] < 0 ? x : par[x] = root(par[x]);}bool unite(int x, int y) {x = root(x), y = root(y);if (x == y) return false;sz--;if (par[x] < par[y]) swap(x,y);par[y] += par[x];par[x] = y;return true;}bool same(int x, int y) { return root(x) == root(y); }int size(int x) { return -par[root(x)]; }int size() const { return sz; }vector<vector<int>> groups() {vector<vector<int>> g(n);rep (i,n) if (par[i] < 0) g[i].reserve(-par[i]);rep (i,n) g[root(i)].push_back(i);vector<vector<int>> grp; grp.reserve(size());rep (i,n) if (g[i].size()) grp.emplace_back(move(g[i]));return grp;}};// <<<int32_t main() {int n, D, W; cin >> n >> D >> W;vector<int> a(D), b(D), c(W), d(W);rep (i,D) cin >> a[i] >> b[i], --a[i], --b[i];rep (i,W) cin >> c[i] >> d[i], --c[i], --d[i];UnionFind uf_D(n), uf_W(n);rep (i,D) uf_D.unite(a[i], b[i]);rep (i,W) uf_W.unite(c[i], d[i]);dump(uf_D.groups());dump(uf_W.groups());int ans = 0;vector<int> used(n);for (auto const& v : uf_D.groups()) {int sum = 0;for (int i : v) {int x = uf_W.root(i);if (used[x]) continue;used[x] = 1;sum += uf_W.size(x);}ans += sum * v.size();for (int i : v) {int x = uf_W.root(i);used[x] = 0;}}ans -= n;cout << ans << endl;}