結果

問題 No.399 動的な領主
ユーザー fumiphysfumiphys
提出日時 2019-08-04 16:21:17
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 686 ms / 2,000 ms
コード長 8,101 bytes
コンパイル時間 2,347 ms
コンパイル使用メモリ 195,292 KB
実行使用メモリ 39,096 KB
最終ジャッジ日時 2023-09-22 18:36:20
合計ジャッジ時間 9,792 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 4 ms
4,376 KB
testcase_05 AC 38 ms
5,928 KB
testcase_06 AC 654 ms
31,524 KB
testcase_07 AC 686 ms
31,448 KB
testcase_08 AC 640 ms
31,448 KB
testcase_09 AC 647 ms
31,444 KB
testcase_10 AC 5 ms
4,380 KB
testcase_11 AC 35 ms
5,932 KB
testcase_12 AC 514 ms
32,176 KB
testcase_13 AC 507 ms
32,300 KB
testcase_14 AC 279 ms
39,056 KB
testcase_15 AC 335 ms
39,096 KB
testcase_16 AC 404 ms
35,076 KB
testcase_17 AC 661 ms
31,384 KB
testcase_18 AC 666 ms
31,504 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
struct Tree{
  int n = 0;
  vector<vector<int>> edges;
  vector<int> b, e;
  vector<int> v;
  Tree(){}
  Tree(int n): n(n){
    edges.resize(n);
    b.resize(n);
    e.resize(n);
    v.reserve(2 * n - 1);
  }
  void adde(int from, int to){
    edges[from].emplace_back(to);
  }
  void dfs(int i){
    v.emplace_back(i);
    b[i] = int(v.size()) - 1;
    for(auto c: edges[i]){
      if(b[c] == -1){
        dfs(c); 
        v.emplace_back(i);
      }
    }
    e[i] = int(v.size()) - 1;
  }
  void build(int r = 0){
    b.assign(n, -1);
    e.assign(n, -1);
    v.resize(0);
    dfs(r);
  }
};

struct Tree2{
  int n = 0, m = 0;
  vector<vector<int>> edge;
  vector<vector<int>> par;
  vector<bool> vis;
  vector<int> h;
  Tree2(){}
  Tree2(int n): n(n){
    while((1LL<<m) <= n)m++;
    edge.resize(n);
    par.assign(m + 1, vector<int>(n, 0));
    vis.resize(n, false);
    h.resize(n);
  }
  void adde(int from, int to){
    edge[from].emplace_back(to);
  }
  void dfs(int i){
    vis[i] = true;
    for(auto e: edge[i]){
      if(!vis[e]){
        par[0][e] = i;
        h[e] = h[i] + 1;
        dfs(e);
      }
    }
  }
  void build(){
    fill(vis.begin(), vis.end(), false);
    fill(h.begin(), h.end(), 0);
    par[0][0] = 0;
    h[0] = 0;
    dfs(0);
    for(int i = 1; i <= m; i++){
      for(int j = 0; j < n; j++){
        par[i][j] = par[i-1][par[i-1][j]];
      }
    }
  }
  int go_up(int u, int k){
    int i = 0;
    while(k){
      if(k % 2 == 1){
        u = par[i][u];
      }
      i++;
      k /= 2;
    }
    return u;
  }
  int lca(int u, int v){
    if(h[u] > h[v])u = go_up(u, h[u] - h[v]);
    if(h[u] < h[v])v = go_up(v, h[v] - h[u]);
    if(u == v)return u;
    int ld = 0, rd = n;
    while(rd - ld > 1){
      int k = (rd + ld) / 2;
      int uk = go_up(u, k);
      int vk = go_up(v, k);
      if(uk == vk)rd = k;
      else ld = k;
    }
    return go_up(u, rd);
  }
};


template<typename T, typename E>
struct LazySegmentTree_ {
  function<T(T, T)> f;
  function<E(E, E)> h;
  function<T(T, E, int)> p;
  int n;
  T def;
  E l_def;
  vector<T> vec;
  vector<E> lazy;
  LazySegmentTree_(){}
  LazySegmentTree_(int n_, function<T(T, T)> f_, T def_,
      function<E(E, E)> h_, E l_def_, function<T(T, E, int)> p_, vector<T> v=vector<T>()){
    f = f_;
    h = h_;
    p = p_;
    def = def_;
    l_def = l_def_;

    // initialize vector
    n = 1;
    while(n < n_){
      n *= 2;
    }
    vec = vector<T>(2*n-1, def);
    lazy = vector<E>(2*n-1, l_def);

    // initialize segment tree
    for(int i = 0; i < v.size(); i++){
      vec[i + n - 1] = v[i];
    }
    for(int i = n - 2; i >= 0; i--){
      vec[i] = f(vec[2*i+1], vec[2*i+2]);
    }
  }
  void eval(int k, int len){
    if(lazy[k] != l_def){
      if(k < n - 1){
        lazy[2*k+1] = h(lazy[2*k+1], lazy[k]);
        lazy[2*k+2] = h(lazy[2*k+2], lazy[k]);
      }
      vec[k] = p(vec[k], lazy[k], len);
      lazy[k] = l_def;
    }
  }
  E update(int a, int b, const E &val, int k, int l, int r){
    eval(k, r - l);
    if(r <= a || b <= l){
      return vec[k];
    }else if(a <= l && r <= b){
      lazy[k] = h(lazy[k], val);
      eval(k, r - l);
      return vec[k];
    }else{
      return vec[k] = f(update(a, b, val, 2*k+1, l, (l+r)/2),
          update(a, b, val, 2*k+2, (l+r)/2, r));
    }
  }
  E update(int a, int b, E val){
    return update(a, b, val, 0, 0, n);
  }
  // [l, r) -> [a, b) (at k)
  T query(int a, int b, int k, int l, int r){
    eval(k, r - l);
    if(r <= a || b <= l)return def;
    if(a <= l && r <= b)return vec[k];
    T ld = query(a, b, 2*k+1, l, (l+r)/2);
    T rd = query(a, b, 2*k+2, (l+r)/2, r);
    return f(ld, rd);
  }
  T query(int a, int b){
    return query(a, b, 0, 0, n);
  }
};

template<typename T, typename E>
using LazySegmentTree = struct LazySegmentTree_<T, E>;
using LazySegmentTreeI = LazySegmentTree<int, int>;
using LazySegmentTreeL = LazySegmentTree<long long, long long>;

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n);
  Tree t(n);
  Tree2 t2(n);
  rep(i, n - 1){
    INT(u); INT(v); u--; v--;
    t.adde(u, v);
    t.adde(v, u);
    t2.adde(u, v);
    t2.adde(v, u);
  }
  t.build();
  t2.build();
  LazySegmentTreeL seg = LazySegmentTreeL(2 * n, [](ll a, ll b){return a + b;},
                                          0, [](ll a, ll b){return a + b;}, 0, [](ll a, ll b, int c){return a + b * c;}, vector<ll>());
  INT(q);
  rep(i, q){
    INT(a); INT(b); a--; b--;
    int l = t2.lca(a, b);
    seg.update(0, t.b[a] + 1, 1);
    seg.update(0, t.b[b] + 1, 1);
    seg.update(0, t.b[l] + 1, -2);
    seg.update(t.b[l], t.b[l] + 1, 1);
    /*rep(j, n){
      cout << seg.query(t.b[j], t.b[j] + 1) - seg.query(t.e[j] + 1, t.e[j] + 2) << "\n "[j + 1 != n];
      }*/
  }
  ll res = 0;
  rep(i, n){
    ll tmp = seg.query(t.b[i], t.b[i] + 1) - seg.query(t.e[i] + 1, t.e[i] + 2);
    res += tmp * (tmp + 1) / 2;
  }
  cout << res << endl;
  return 0;
}
0