結果
| 問題 |
No.922 東北きりきざむたん
|
| コンテスト | |
| ユーザー |
 ningenMe
|
| 提出日時 | 2020-04-05 18:41:40 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 179 ms / 2,000 ms |
| コード長 | 9,644 bytes |
| コンパイル時間 | 2,357 ms |
| コンパイル使用メモリ | 195,548 KB |
| 実行使用メモリ | 62,880 KB |
| 最終ジャッジ日時 | 2024-07-03 08:20:45 |
| 合計ジャッジ時間 | 6,355 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
//Union Find Tree
class UnionFindTree {
public:
vector<int> parent;
vector<int> rank;
UnionFindTree(int N) : parent(N), rank(N,0){
for (int i = 0; i < N; ++i) parent[i] = i;
}
int root(int n) {
return (parent[n] == n ? n : parent[n] = root(parent[n]));
}
int same(int n, int m) {
return root(n) == root(m);
}
void unite(int n, int m) {
n = root(n);
m = root(m);
if (n == m) return;
if(rank[n]<rank[m]) {
parent[n] = m;
}
else{
parent[m] = n;
if(rank[n] == rank[m]) rank[n]++;
}
}
};
template<class Operator> class Tree {
Operator Op;
using typeDist = decltype(Op.unitDist);
size_t num;
size_t ord;
public:
vector<vector<pair<size_t,typeDist>>> edge;
vector<size_t> depth;
vector<size_t> order;
vector<size_t> reorder;
vector<typeDist> dist;
vector<pair<size_t,typeDist>> parent;
vector<vector<pair<size_t,typeDist>>> child;
vector<array<pair<size_t,typeDist>,Operator::bit>> ancestor;
vector<size_t> size;
vector<vector<size_t>> descendant;
vector<size_t> head;
Tree(const int num):num(num),edge(num),depth(num,-1),order(num),dist(num){}
//O(1) anytime
void makeEdge(const int& from, const int& to, const typeDist w = 1) {
edge[from].push_back({to,w});
}
//O(N) anytime
void makeDepth(const int root) {
depth[root] = 0;
dist[root] = Op.unitDist;
ord = 0;
dfs1(root);
order[ord++] = root;
reverse_copy(order.begin(),order.end(),back_inserter(reorder));
}
//O(N) anytime
void makeDepth(void) {
ord = 0;
for(size_t root = 0; root < num; ++root) {
if(depth[root] != -1) continue;
depth[root] = 0;
dist[root] = Op.unitDist;
dfs1(root);
order[ord++] = root;
}
reverse_copy(order.begin(),order.end(),back_inserter(reorder));
}
//for makeDepth
void dfs1(int curr, int prev = -1){
for(auto& e:edge[curr]){
int next = e.first;
if(next==prev) continue;
depth[next] = depth[curr] + 1;
dist[next] = Op.funcDist(dist[curr],e.second);
dfs1(next,curr);
order[ord++] = next;
}
}
//O(N) after makeDepth
void makeParent(void) {
parent.resize(num,make_pair(num,Op.unitDist));
for (size_t i = 0; i < num; ++i) for (auto& e : edge[i]) if (depth[i] > depth[e.first]) parent[i] = e;
}
//O(N) after makeDepth
void makeChild(void) {
child.resize(num);
for (size_t i = 0; i < num; ++i) for (auto& e : edge[i]) if (depth[i] < depth[e.first]) child[i].push_back(e);
}
//O(NlogN) after makeDepth and makeParent
void makeAncestor(void) {
ancestor.resize(num);
for (size_t i = 0; i < num; ++i) ancestor[i][0] = (parent[i].first!=num?parent[i]:make_pair(i,Op.unitLca));
for (size_t j = 1; j < Operator::bit; ++j) {
for (size_t i = 0; i < num; ++i) {
size_t k = ancestor[i][j - 1].first;
ancestor[i][j] = Op.funcLca(ancestor[k][j - 1],ancestor[i][j - 1]);
}
}
}
//O(logN) after makeAncestor
//return {lca,lca_dist} l and r must be connected
pair<size_t,typeDist> lca(size_t l, size_t r) {
if (depth[l] < depth[r]) swap(l, r);
int diff = depth[l] - depth[r];
auto ancl = make_pair(l,Op.unitLca);
auto ancr = make_pair(r,Op.unitLca);
for (int j = 0; j < Operator::bit; ++j) {
if (diff & (1 << j)) {
ancl = Op.funcLca(ancestor[ancl.first][j],ancl);
}
}
if(ancl.first==ancr.first) return ancl;
for (int j = Operator::bit - 1; 0 <= j; --j) {
if(ancestor[ancl.first][j].first!=ancestor[ancr.first][j].first) {
ancl = Op.funcLca(ancestor[ancl.first][j],ancl);
ancr = Op.funcLca(ancestor[ancr.first][j],ancr);
}
}
ancl = Op.funcLca(ancestor[ancl.first][0],ancl);
ancr = Op.funcLca(ancestor[ancr.first][0],ancr);
return Op.funcLca(ancl,ancr);
}
//O(N) anytime
int diameter(void){
makeDepth(0);
int tmp = max_element(depth.begin(), depth.end()) - depth.begin();
makeDepth(tmp);
return *max_element(depth.begin(), depth.end());
}
//O(N^2) after makeDepth (include self)
void makeDescendant(void) {
descendant.resize(num);
for (size_t i = 0; i < num; ++i) descendant[i].push_back(i);
for (size_t i = 0; i < num; ++i) for (auto& e : edge[order[i]]) if (depth[order[i]] < depth[e.first]) for(auto k: descendant[e.first]) descendant[order[i]].push_back(k);
}
//O(N) after makeChild
void makeSize(void) {
size.resize(num,1);
for (size_t i:order) for (auto e : child[i]) size[i] += size[e.first];
}
//(N) after makeDepth and makeChild
template<class typeReroot> vector<typeReroot> rerooting(vector<typeReroot> rerootdp,vector<typeReroot> rerootparent) {
for(size_t pa:order) for(auto& e:child[pa]) rerootdp[pa] = Op.funcReroot(rerootdp[pa],rerootdp[e.first]);
for(size_t pa:reorder) {
if(depth[pa]) rerootdp[pa] = Op.funcReroot(rerootdp[pa],rerootparent[pa]);
size_t m = child[pa].size();
for(int j = 0; j < m && depth[pa]; ++j){
size_t ch = child[pa][j].first;
rerootparent[ch] = Op.funcReroot(rerootparent[ch],rerootparent[pa]);
}
if(m <= 1) continue;
vector<typeReroot> l(m),r(m);
for(int j = 0; j < m; ++j) {
size_t ch = child[pa][j].first;
l[j] = rerootdp[ch];
r[j] = rerootdp[ch];
}
for(int j = 1; j+1 < m; ++j) l[j] = Op.funcRerootMerge(l[j],l[j-1]);
for(int j = m-2; 0 <=j; --j) r[j] = Op.funcRerootMerge(r[j],r[j+1]);
size_t chl = child[pa].front().first;
size_t chr = child[pa].back().first;
rerootparent[chl] = Op.funcReroot(rerootparent[chl],r[1]);
rerootparent[chr] = Op.funcReroot(rerootparent[chr],l[m-2]);
for(int j = 1; j+1 < m; ++j) {
size_t ch = child[pa][j].first;
rerootparent[ch] = Op.funcReroot(rerootparent[ch],l[j-1]);
rerootparent[ch] = Op.funcReroot(rerootparent[ch],r[j+1]);
}
}
return rerootdp;
}
//O(N) after makeDepth,makeParent,makeChild
void heavyLightDecomposition(){
head.resize(num);
}
};
//depth,dist
//https://atcoder.jp/contests/abc126/tasks/abc126_d
//child
//https://atcoder.jp/contests/abc133/tasks/abc133_e
//lca
//https://atcoder.jp/contests/abc014/tasks/abc014_4
//weighted lca
//https://atcoder.jp/contests/code-thanks-festival-2017-open/tasks/code_thanks_festival_2017_h
//https://atcoder.jp/contests/cf16-tournament-round1-open/tasks/asaporo_c
//diameter
//https://atcoder.jp/contests/agc033/tasks/agc033_c
//descendant
//https://atcoder.jp/contests/code-thanks-festival-2018/tasks/code_thanks_festival_2018_f
//size
//https://yukicoder.me/problems/no/872
//eulerTour
//https://yukicoder.me/problems/no/900
template<class typeDist> struct treeOperator{
static const size_t bit = 20;
typeDist unitDist = 0;
typeDist unitLca = 0;
typeDist funcDist(const typeDist& parent,const typeDist& w){return parent+w;}
pair<size_t,typeDist> funcLca(const pair<size_t,typeDist>& l,const pair<size_t,typeDist>& r){return make_pair(l.first,l.second+r.second);}
template<class typeReroot> typeReroot funcReroot(const typeReroot& l,const typeReroot& r) {
return {l.first+r.first+r.second,l.second+r.second};
}
template<class typeReroot> typeReroot funcRerootMerge(const typeReroot& l,const typeReroot& r) {
return {l.first+r.first,l.second+r.second};
}
};
// Tree<treeOperator<int>> tree(N);
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
int main() {
SPEED
int N,M,Q; cin >> N >> M >> Q;
UnionFindTree uf(N);
Tree<treeOperator<ll>> tree(N);
for(int i = 0; i < M; ++i){
int u,v; cin >> u >> v;
u--,v--;
uf.unite(u,v);
tree.makeEdge(u,v);
tree.makeEdge(v,u);
}
tree.makeDepth();
tree.makeParent();
tree.makeAncestor();
tree.makeChild();
ll ans = 0;
vector<pair<ll,ll>> cnt(N,{0,0}),par(N,{0,0});
for(int i = 0; i < Q; ++i){
int a,b; cin >> a >> b;
a--,b--;
if(uf.same(a,b)){
ans += tree.lca(a,b).second;
}
else{
cnt[a].second++;
cnt[b].second++;
}
}
for(int i = 0; i < N; ++i) if(tree.depth[i]) par[i] = cnt[tree.parent[i].first];
auto dp = tree.rerooting<pair<ll,ll>>(cnt,par);
const ll inf = 1e15;
vector<ll> sum(N,inf);
for(int i = 0,j; i < N; ++i) j = uf.root(i),sum[j] = min(sum[j],dp[i].first);
for(int i = 0; i < N; ++i) if(sum[i] != inf) ans += sum[i];
cout << ans << endl;
return 0;
}