結果
問題 | No.922 東北きりきざむたん |
ユーザー | ningenMe |
提出日時 | 2019-11-08 23:14:57 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 12,163 bytes |
コンパイル時間 | 2,415 ms |
コンパイル使用メモリ | 195,300 KB |
実行使用メモリ | 42,004 KB |
最終ジャッジ日時 | 2023-10-13 04:53:25 |
合計ジャッジ時間 | 6,338 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,352 KB |
testcase_02 | AC | 1 ms
4,352 KB |
testcase_03 | AC | 2 ms
4,352 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 2 ms
4,348 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 47 ms
10,836 KB |
testcase_10 | AC | 25 ms
6,340 KB |
testcase_11 | AC | 41 ms
9,024 KB |
testcase_12 | AC | 35 ms
10,680 KB |
testcase_13 | AC | 14 ms
5,232 KB |
testcase_14 | AC | 77 ms
14,560 KB |
testcase_15 | AC | 33 ms
11,228 KB |
testcase_16 | AC | 131 ms
21,536 KB |
testcase_17 | AC | 129 ms
22,216 KB |
testcase_18 | AC | 133 ms
20,368 KB |
testcase_19 | AC | 128 ms
21,904 KB |
testcase_20 | AC | 134 ms
21,876 KB |
testcase_21 | AC | 139 ms
17,420 KB |
testcase_22 | AC | 137 ms
17,296 KB |
testcase_23 | AC | 195 ms
34,128 KB |
testcase_24 | AC | 182 ms
35,000 KB |
testcase_25 | AC | 142 ms
36,360 KB |
testcase_26 | AC | 140 ms
36,336 KB |
testcase_27 | AC | 142 ms
36,172 KB |
testcase_28 | AC | 57 ms
12,648 KB |
testcase_29 | AC | 166 ms
42,004 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; #define REP(i,n) for(long long i = 0; i < (n); i++) #define FOR(i, m, n) for(long long i = (m);i < (n); ++i) #define ALL(obj) (obj).begin(),(obj).end() #define SPEED cin.tie(0);ios::sync_with_stdio(false); template<class T> using V = vector<T>; template<class T, class U> using P = pair<T, U>; template<class T> using PQ = priority_queue<T>; template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = (long long)1e9 + 7; constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} 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)...);} template <class T> void chmax(T& a, const T b){a=max(a,b);} template <class T> void chmin(T& a, const T b){a=min(a,b);} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} vector<vector<int>> edge; vector<ll> dist,dp,dp2,sum; vector<ll> cnt; vector<int> vv; void dfs(int curr,int prev){ for(int next:edge[curr]){ if(next==prev) continue; dist[next] = dist[curr] + 1; dfs(next, curr); } if(prev!=-1) { sum[prev] += sum[curr]; } vv.push_back(curr); } //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 T = int> class Tree { public: int nodeNum; int isWeighted; int maxBit; int idx; vector<vector<int>> edge; vector<vector<T>> weight; vector<int> depth; vector<int> order; vector<T> dist; vector<int> parent; vector<T> parentDist; vector<vector<int>> child; vector<vector<T>> childDist; vector<vector<int>> ancestor; vector<vector<int>> descendant; vector<int> eulerTour; vector<T> eulerTourDist; vector<int> eulerTourIdxL; vector<int> eulerTourIdxR; vector<int> eulerTourDive,eulerTourFloat; vector<T> eulerTourDiveDist,eulerTourFloatDist; vector<int> eulerTourDiveIdxL,eulerTourFloatIdxL; vector<int> eulerTourDiveIdxR,eulerTourFloatIdxR; Tree(const int nodeNum, const int isWeighted = 0, const int maxBit = 20) : nodeNum(nodeNum), isWeighted(isWeighted), maxBit(maxBit), edge(nodeNum), depth(nodeNum), order(nodeNum) { if(isWeighted) weight.resize(nodeNum); if(isWeighted) dist.resize(nodeNum); } //O(1) anytime void makeEdge(const int& from, const int& to, const T& w = 0) { edge[from].push_back(to); if(isWeighted) weight[from].push_back(w); } //O(N) anytime void makeDepth(const int root) { depth[root] = 0; if(isWeighted) dist[root] = 0; idx = 0; dfs1(root); order[idx++] = root; } //for makeDepth void dfs1(int from, int prev = -1){ for(int i = 0; i < edge[from].size(); ++i){ int to = edge[from][i]; if(to==prev) continue; depth[to] = depth[from] + 1; if(isWeighted) dist[to] = dist[from] + weight[from][i]; dfs1(to,from); order[idx++] = to; } } //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) after makeDepth void makeParent(void) { parent.resize(nodeNum); iota(parent.begin(),parent.end(),0); for (int i = 0; i < nodeNum; ++i) for (auto j : edge[i]) if (depth[i] > depth[j]) parent[i] = j; if(isWeighted) { parentDist.resize(nodeNum); for (int i = 0; i < nodeNum; ++i) for (int j = 0; j < edge[i].size(); ++j) if (depth[i] > depth[edge[i][j]]) parentDist[i] = weight[i][j]; } } //O(N) after makeDepth void makeChild(void) { child.resize(nodeNum); for (int i = 0; i < nodeNum; ++i) for (auto j : edge[i]) if (depth[i] < depth[j]) child[i].push_back(j); if(isWeighted) { childDist.resize(nodeNum); for (int i = 0; i < nodeNum; ++i) for (int j = 0; j < edge[i].size(); ++j) if (depth[i] < depth[edge[i][j]]) childDist[i].push_back(weight[i][j]); } } //O(NlogN) after makeDepth void makeAncestor(void) { ancestor.resize(nodeNum,vector<int>(maxBit)); for (int i = 0; i < nodeNum; ++i) ancestor[i][0] = i; for (int i = 0; i < nodeNum; ++i) for (auto j : edge[i]) if (depth[i] > depth[j]) ancestor[i][0] = j; for (int bit = 1; bit < maxBit; ++bit) for (int i = 0; i < nodeNum; ++i) ancestor[i][bit] = ancestor[ancestor[i][bit - 1]][bit - 1]; } //O(N^2) after makeDepth void makeDescendant(void) { descendant.resize(nodeNum); for (int i = 0; i < nodeNum; ++i) descendant[i].push_back(i); for (int i = 0; i < nodeNum; ++i) for (auto j : edge[order[i]]) if (depth[order[i]] < depth[j]) for(auto k: descendant[j]) descendant[order[i]].push_back(k); } //O(logN) after makeAncestor int lca(int l, int r) { if (depth[l] < depth[r]) swap(l, r); int diff = depth[l] - depth[r]; for (int bit = 0; bit < maxBit; ++bit) if (diff & (1 << bit)) l = ancestor[l][bit]; if(l==r) return l; for (int bit = maxBit - 1; 0 <= bit; --bit) if(ancestor[l][bit]!=ancestor[r][bit]) l = ancestor[l][bit], r = ancestor[r][bit]; return ancestor[l][0]; } //O(N) after makeChild and makeParent void makeEulerTour(void){ dfs2(order[nodeNum-1]); eulerTourIdxL.resize(nodeNum); eulerTourIdxR.resize(nodeNum); for(int i = 0; i < eulerTour.size(); ++i) eulerTourIdxR[eulerTour[i]] = i; for(int i = eulerTour.size()-1; 0 <= i; --i) eulerTourIdxL[eulerTour[i]] = i; return; } //for makeEulerTour void dfs2(int from, int prev = -1){ eulerTour.push_back(from); if(isWeighted) eulerTourDist.push_back(parentDist[from]); for(int i = 0; i < child[from].size(); ++i){ int to = child[from][i]; dfs2(to,from); eulerTour.push_back(from); if(isWeighted) eulerTourDist.push_back(-childDist[from][i]); } } //O(NlogN) after makeEulerTour void makeEulerTourEdge(void) { eulerTourDive.push_back(order[nodeNum-1]); if(isWeighted) eulerTourDiveDist.push_back(0); for(int i = 1; i < eulerTour.size(); ++i) { int l = eulerTour[i-1]; int r = eulerTour[i]; if(depth[l] < depth[r]) { eulerTourDive.push_back(i); if(isWeighted) eulerTourDiveDist.push_back(eulerTourDist[i]); } else { eulerTourFloat.push_back(i); if(isWeighted) eulerTourFloatDist.push_back(eulerTourDist[i]); } } eulerTourDiveIdxL.resize(nodeNum); eulerTourDiveIdxR.resize(nodeNum); eulerTourFloatIdxL.resize(nodeNum); eulerTourFloatIdxR.resize(nodeNum); for(int i = 0; i < nodeNum; ++i) { int l = eulerTourIdxL[i]; int r = eulerTourIdxR[i]; eulerTourDiveIdxL[i] = upper_bound(eulerTourDive.begin() ,eulerTourDive.end() ,l) - eulerTourDive.begin() ; eulerTourDiveIdxR[i] = (upper_bound(eulerTourDive.begin() ,eulerTourDive.end() ,r) - eulerTourDive.begin()) -1; eulerTourFloatIdxL[i] = upper_bound(eulerTourFloat.begin(),eulerTourFloat.end(),l) - eulerTourFloat.begin() ; eulerTourFloatIdxR[i] = (upper_bound(eulerTourFloat.begin(),eulerTourFloat.end(),r) - eulerTourFloat.begin()) -1; eulerTourDiveIdxR[i] = max(eulerTourDiveIdxL[i]-1 ,eulerTourDiveIdxR[i]); eulerTourFloatIdxR[i] = max(eulerTourFloatIdxL[i]-1,eulerTourFloatIdxR[i]); } } // iの部分木の頂点に加算するとき // [ eulerTourIdxL[i] ,eulerTourIdxR[i] ]に +val // [i]の頂点クエリ // [eulerTourIdxL[i],eulerTourIdxL[i]] // iの部分木の辺に加算するとき // [ eulerTourDiveIdxL[i] ,eulerTourDiveIdxR[i] ]に +val // [ eulerTourFloatIdxL[i] ,eulerTourFloatIdxR[i] ]に -val // [0,i]のパスクエリ // [ 0, eulerTourDiveIdxL[i] ) + [0, eulerTourFloatIdxL[i]) }; //depth,dist //https://atcoder.jp/contests/abc126/tasks/abc126_d //lca //https://atcoder.jp/contests/abc014/tasks/abc014_4 //child //https://atcoder.jp/contests/abc133/tasks/abc133_e //diameter //https://atcoder.jp/contests/agc033/tasks/agc033_c //eulerTour //https://yukicoder.me/problems/no/900 //verify https://atcoder.jp/contests/abc097/tasks/arc097_b int main() { SPEED int N,M,Q; cin >> N >> M >> Q; edge.resize(N); dist.resize(N,-1); dp.resize(N,0); dp2.resize(N,0); sum.resize(N,0); cnt.resize(N,0); UnionFindTree uf(N); for(int i = 0; i < M; ++i){ int u,v; cin >> u >> v; u--,v--; edge[u].push_back(v); edge[v].push_back(u); uf.unite(u,v); } vector<vector<P<int,int>>> pp(N); for(int i = 0; i < Q; ++i){ int a,b; cin >> a >> b; a--,b--; if(uf.same(a,b)){ pp[uf.root(a)].push_back({a,b}); } else{ cnt[a]++; cnt[b]++; } } sum = cnt; ll ans = 0; vector<int> dd(N,-1); for(int i = 0; i < N; ++i) { if(dist[i]!=-1) continue; dist[i] = 0; vv.clear(); dfs(i,-1); reverse(ALL(vv)); ll mmm = 0; for(auto e:vv) dp[i] += cnt[e]*dist[e]; for(auto e:vv) mmm += cnt[e]; int rt = uf.root(i); int idx = 0; int L = vv.size(); Tree<> tree(L); for(auto pa:vv) dd[pa] = idx++; for(auto pa:vv){ for(auto ch:edge[pa]){ if(dist[ch]<dist[pa]) continue; tree.makeEdge(dd[pa],dd[ch]); tree.makeEdge(dd[ch],dd[pa]); } } tree.makeDepth(dd[i]); tree.makeAncestor(); for(auto lr:pp[rt]) { ans += (dist[lr.first]+dist[lr.second]-2*dist[vv[tree.lca(dd[lr.first],dd[lr.second])]]); } for(auto pa:vv){ for(auto ch:edge[pa]){ if(dist[ch]<dist[pa]) continue; dp[ch] = dp[pa] - sum[ch] + (mmm - sum[ch]); } } ll mini = LOWINF; for(auto e:vv) chmin(mini,dp[e]); ans += mini; } cout << ans << endl; return 0; }