結果
| 問題 | No.399 動的な領主 |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-07-14 00:04:39 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 211 ms / 2,000 ms |
| コード長 | 8,683 bytes |
| コンパイル時間 | 1,332 ms |
| コンパイル使用メモリ | 113,912 KB |
| 実行使用メモリ | 25,788 KB |
| 最終ジャッジ日時 | 2024-11-07 18:29:26 |
| 合計ジャッジ時間 | 4,346 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 19 |
ソースコード
/*### ############## ################################################################################################################################################ ##################################### ####### ############################ ################# ################### # ########################## ######### ################################### # ########################### ############## ################################ ######### ################################### ####### ###################################### # ####### ################################################ ################################################ ################################################ ############################################## ########################################## ################################# ######################### ################ ######## ### ## # ## # # # # # #### #### #### #### ##### # # # # ## # # # # # # #____# ### #/ # # ## # # # # # # # #^^^^ ### ###/# # # # #### #### ###/# #### ####*/#include <iostream>#include <vector>#include <cstdio>#include <sstream>#include <map>#include <string>#include <algorithm>#include <queue>#include <cmath>#include <functional>#include <set>#include <ctime>#include <random>#include <chrono>#include <cassert>using namespace std;namespace {using Integer = long long; //__int128;template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}template<class T> istream& operator , (istream& is, T& val){ return is >> val;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}template<class H> void print(const H& head){ cout << head; }template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }template<class H> void eprint(const H& head){ cerr << head; }template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }class range{long long start_, end_, step_;public:struct range_iterator{long long val, step_;range_iterator(long long v, long long step) : val(v), step_(step) {}long long operator * (){return val;}void operator ++ (){val += step_;}bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}};range(long long len) : start_(0), end_(len), step_(1) {}range(long long start, long long end) : start_(start), end_(end), step_(1) {}range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}range_iterator begin(){ return range_iterator(start_, step_); }range_iterator end(){ return range_iterator( end_, step_); }};string operator "" _s (const char* str, size_t size){ return move(string(str)); }constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexedmt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());template<class T> string join(const vector<T>& v, const string& sep){stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();}string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }}class LCA{int root;//depth of node[i]vector<int> d;//parent of node[i]vector<vector<int> > p;int size;//initialization of depths and parentsvoid init(vector<vector<int> > &g, int pos, int last, int v){d[pos] = v;p[0][pos] = last;for(int i=0; i<g[pos].size(); i++){if(g[pos][i] == last) continue;init(g, g[pos][i], pos, v+1);}}public://vector<vector<int> >//g[i][j] := node[i]'s edge gose to node[ g[i][j] ]LCA(vector<vector<int> > &g, int r){int n = g.size();root = r;d = vector<int>(n);size = 1;while((1<<size) <= n){size++;}p = vector<vector<int> >(size, vector<int>(n));init(g, root,-1,0);for(int k=0; k+1 < size; k++){for(int v=0; v<n; v++){if(p[k][v] < 0) p[k+1][v] = -1;else p[k+1][v] = p[k][p[k][v]];}}}LCA(vector<vector<int> > &g){int n = g.size();root = 0;d = vector<int>(n);size = 1;while((1<<size) <= n){size++;}p = vector<vector<int> >(size, vector<int>(n));//initialize as root = 0init(g, root,-1,0);for(int k=0; k+1 < size; k++){for(int v=0; v<n; v++){if(p[k][v] < 0) p[k+1][v] = -1;else p[k+1][v] = p[k][p[k][v]];}}}//return the node number of lowest common ancestor between u and vint get_lca(int u, int v){if(d[u] > d[v]) swap(u,v);for(int k=0; k<size; k++){if( (d[v] - d[u]) >> k & 1){v = p[k][v];}}if(u==v) return u;for(int k=size-1; k>=0; k--){if(p[k][u] != p[k][v]) {u = p[k][u];v = p[k][v];}}return p[0][u];}int get_parent(int u){return p[0][u];}//return depth of node[u]int depth(int u){return d[u];}};int main(){int n;cin >> n;vector<vector<int>> G(n+1);G[0].push_back(1);G[1].push_back(0);for(int _ : range(n-1)){int u,v;cin >> u,v;G[u].push_back(v);G[v].push_back(u);}LCA t(G);vector<long long> s(n+1, 0);vector<vector<int>> d(n+1);for(int v : range(1, n+1)){d[ t.depth(v) ].push_back( v );}int q;cin >> q;while(q--){int u,v;cin >> u,v;int p = t.get_lca(u,v);s[u]++;s[v]++;s[p]--;s[ t.get_parent(p) ]--;}long long ans = 0;for(int dd=n; dd>0; dd--){for(int v : d[dd]){ans += s[v] * (s[v] + 1) / 2;s[ t.get_parent(v) ] += s[v];}}println(ans);return 0;}