結果
| 問題 | No.399 動的な領主 |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-07-14 23:36:37 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 125 ms / 2,000 ms |
| コード長 | 8,752 bytes |
| コンパイル時間 | 1,754 ms |
| コンパイル使用メモリ | 119,532 KB |
| 実行使用メモリ | 42,208 KB |
| 最終ジャッジ日時 | 2024-11-07 18:31:21 |
| 合計ジャッジ時間 | 3,832 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,248 KB |
| testcase_02 | AC | 2 ms
5,248 KB |
| testcase_03 | AC | 2 ms
5,248 KB |
| testcase_04 | AC | 3 ms
5,248 KB |
| testcase_05 | AC | 11 ms
5,632 KB |
| testcase_06 | AC | 125 ms
27,948 KB |
| testcase_07 | AC | 125 ms
28,060 KB |
| testcase_08 | AC | 124 ms
28,244 KB |
| testcase_09 | AC | 124 ms
28,232 KB |
| testcase_10 | AC | 3 ms
5,248 KB |
| testcase_11 | AC | 10 ms
5,760 KB |
| testcase_12 | AC | 107 ms
28,400 KB |
| testcase_13 | AC | 105 ms
28,640 KB |
| testcase_14 | AC | 104 ms
42,208 KB |
| testcase_15 | AC | 103 ms
42,080 KB |
| testcase_16 | AC | 99 ms
34,708 KB |
| testcase_17 | AC | 119 ms
27,964 KB |
| testcase_18 | AC | 124 ms
27,968 KB |
ソースコード
/*
### #
############# #
#######################
################################
#########################################
##############################################
# ##################################### #
###### ############################ ######
########### ################### # ##########
################ ######### ###############
#################### # ####################
####### ############## ########################
######## ######### ########################
########### ####### ########################
############## # ####### ########################
######################## ########################
######################## ########################
######################## ########################
###################### #######################
################### ###################
############## ###############
########## ##########
###### ######
## ##
# #
# # #
# # # # # # #### #### #### #### ####
# # # # # ## # # # # # # #____# ##
# #/ # # ## # # # # # # # #^^^^ #
## ###/# # # # #### #### ###/# #### #
#
##
*/
#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-indexed
mt19937 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; }
}
template<class T>
class SparseTable{
public:
SparseTable(vector<T>& vec, T default_value_, function<T(T,T)> eval)
: col(vec.size()), default_value(default_value_)
{
evaluate = eval;
row = 1;
while((1<<row) < col) row += 1;
row++;
table = vector<vector<int>>(row, vector<int>(col));
set(vec);
}
void set(vector<T>& vec){
assert(col == vec.size());
values = &vec;
vector<T>& val = vec;
iota(table[0].begin(), table[0].end(), 0);
for(int k=1; k<row; k++){
for(int i=0; i + (1<<k)-1 < col; i++){
auto left = val[table[k-1][i]];
auto right = val[table[k-1][i+(1<<(k-1))]];
if(left == evaluate(left,right)){
table[k][i] = table[k-1][i];
}else{
table[k][i] = table[k-1][i+(1<<(k-1))];
}
}
}
}
//[l,r)
T get(int l, int r){
if(l>=r) return default_value;
vector<T>& val = *values;
T ret = default_value;
int k = 0;
while((1<<(k+1)) < (r-l)) k++;
auto left = val[ table[k][l] ];
auto right = val[ table[k][r-(1<<k)] ];
ret = evaluate(left, right);
return ret;
}
private:
int col;
int row;
T default_value;
vector<T>* values;
vector<vector<int>> table;
function<T(T,T)> evaluate;
};
int main(){
int n;
scanf("%d", &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;
scanf("%d%d", &u, &v);
G[u].push_back(v);
G[v].push_back(u);
}
vector<int> parent(n+1, 0);
vector<int> depth (n+1, 0);
vector<int> a(n+1, 0);
vector<pair<int,int>> b;
function<void(int,int)> EulerTour = [&](int pos, int last){
parent[pos] = last;
depth[pos] = depth[last] + 1;
a[pos] = b.size();
b.push_back({depth[pos], pos});
for(int nx : G[pos]){
if(nx == last) continue;
EulerTour(nx, pos);
b.push_back({depth[pos], pos});
}
};
EulerTour(1, 0);
SparseTable< pair<int,int> > t(b, {8_ten, 8_ten}, [&](pair<int,int> a, pair<int,int> b){return a<b ? a : b;});
vector<long long> s(n+1, 0);
vector<vector<int>> d( *max_element(depth.begin(), depth.end()) + 1 );
for(int v : range(1, n+1)){
d[ depth[v] ].push_back( v );
}
int q;
scanf("%d", &q);
while(q--){
int u,v;
scanf("%d%d", &u, &v);
int p = t.get( min(a[u], a[v]), max(a[u], a[v]) ).second;
s[u]++;
s[v]++;
s[p]--;
s[ parent[p] ]--;
}
long long ans = 0;
for(int dd=d.size()-1; dd>0; dd--){
for(int v : d[dd]){
ans += s[v] * (s[v] + 1) / 2;
s[ parent[v] ] += s[v];
}
}
println(ans);
return 0;
}