結果
問題 | No.1293 2種類の道路 |
ユーザー |
![]() |
提出日時 | 2020-11-27 13:58:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 3,223 bytes |
コンパイル時間 | 3,591 ms |
コンパイル使用メモリ | 208,472 KB |
最終ジャッジ日時 | 2025-01-16 06:04:13 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;/*#include <atcoder/all>using namespace atcoder;*/#define all(hoge) (hoge).begin(), (hoge).end()#define en '\n'using ll = long long;using ull = unsigned long long;#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)#define REP(i, n) rep(i, 0, n)#define REP2(i, n) rep2(i, 0, n)template <class T>using vec = vector<T>;template <class T>using vvec = vector<vec<T>>;typedef pair<ll, ll> P;using tp = tuple<ll, ll, ll>;constexpr long long INF = 1LL << 60;constexpr int INF_INT = 1 << 25;constexpr long long MOD = (ll)1e9 + 7;//constexpr long long MOD = 998244353LL;using ld = long double;static const ld pi = 3.141592653589793L;using Array = vector<ll>;using Matrix = vector<Array>;/*#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")*/template <class T>inline bool chmin(T &a, T b) {if(a > b) {a = b;return true;}return false;}template <class T>inline bool chmax(T &a, T b) {if(a < b) {a = b;return true;}return false;}//グラフ関連struct Edge {ll to, cap, rev;Edge(ll _to, ll _cap, ll _rev) {to = _to;cap = _cap;rev = _rev;}};typedef vector<Edge> Edges;typedef vector<Edges> Graph;void add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {G[from].push_back(Edge(to, cap, (ll)G[to].size()));if(revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));}class UnionFind {vector<int> data;int num;public:UnionFind(int size) : data(size, -1), num(size) {}bool unionSet(int x, int y) {x = root(x);y = root(y);if(x != y) {if(data[y] < data[x])swap(x, y);data[x] += data[y];data[y] = x;num--;}return x != y;}bool findSet(int x, int y) {return root(x) == root(y);}int root(int x) {return data[x] < 0 ? x : data[x] = root(data[x]);}int size(int x) {return -data[root(x)];}int numSet() {return num;}};void solve() {ll n;cin >> n;ll d, w;cin >> d >> w;UnionFind X(n), Y(n);REP(i, d) {ll a, b;cin >> a >> b;a--;b--;X.unionSet(a, b);}REP(i, w) {ll a, b;cin >> a >> b;a--;b--;Y.unionSet(a, b);}vvec<ll> xs(n);REP(i, n) {int r = X.root(i);xs[r].push_back(i);}ll ans = 0;REP(i, n) {if(xs[i].size() == 0)continue;set<ll> st;for(auto x : xs[i]) {st.insert(Y.root(x));}ll con = 0;for(auto y : st)con += Y.size(y);con = (con - 1) * X.size(i);ans += con;}cout << ans << en;}int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);/*ll t;cin >> t;REP(i, t - 1) {solve();}*/solve();return 0;}