結果
問題 | No.1293 2種類の道路 |
ユーザー |
|
提出日時 | 2020-11-20 21:50:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 3,347 bytes |
コンパイル時間 | 2,311 ms |
コンパイル使用メモリ | 206,076 KB |
最終ジャッジ日時 | 2025-01-16 02:16:39 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define rep(i,n) for (int i = 0; i < int(n); ++i)#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define pb push_back#define eb emplace_back#define vi vector<int>#define vvi vector<vector<int>>#define vl vector<ll>#define vvl vector<vector<ll>>#define vd vector<double>#define vvd vector<vector<double>>#define vs vector<string>#define vc vector<char>#define vvc vector<vector<char>>#define vb vector<bool>#define vvb vector<vector<bool>>#define vp vector<P>#define vvp vector<vector<P>>using namespace std;using ll = long long;using P = pair<int,int>;using LP = pair<ll,ll>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:onclass unionfind {int n;vector<int> par, rank;public:unionfind(int n) : n(n), par(n, -1), rank(n, 0) {}int root(int x) {if (par[x] < 0) return x;else return par[x] = root(par[x]);}bool same(int x, int y) { return root(x) == root(y); };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);if (rank[x] == rank[y]) rank[x]++;par[x] += par[y];par[y] = x;return true;}int size(int x) { return -par[root(x)]; };bool connected() {rep(i, n - 1) if (!same(i, i + 1)) return false;return true;}};int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);int n, D, w;cin >> n >> D >> w;vvi G(n);rep(_, D) {int a, b;cin >> a >> b;a--;b--;G[a].pb(b);G[b].pb(a);}unionfind uf(n);rep(_, w) {int c, d;cin >> c >> d;c--;d--;uf.merge(c, d);}vb seen(n);vi ls;auto dfs = [&](auto &self, int u) -> void {ls.pb(u);seen[u] = true;for (int v : G[u]) {if (seen[v]) continue;self(self, v);}};ll ans = 0;rep(i, n) {if (seen[i]) continue;dfs(dfs, i);set<int> rt;for (int j : ls) {rt.insert(uf.root(j));}ll cnt = 0;for (int j : rt) {cnt += uf.size(j);}ans += (cnt - 1) * ls.size();ls.clear();}cout << ans << endl;}