結果

問題 No.399 動的な領主
ユーザー mikammikam
提出日時 2022-09-05 16:43:38
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 319 ms / 2,000 ms
コード長 5,091 bytes
コンパイル時間 5,278 ms
コンパイル使用メモリ 275,632 KB
実行使用メモリ 23,168 KB
最終ジャッジ日時 2024-04-30 19:51:03
合計ジャッジ時間 8,422 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 3 ms
6,940 KB
testcase_05 AC 21 ms
6,940 KB
testcase_06 AC 296 ms
18,560 KB
testcase_07 AC 290 ms
18,432 KB
testcase_08 AC 291 ms
18,740 KB
testcase_09 AC 296 ms
18,688 KB
testcase_10 AC 3 ms
6,944 KB
testcase_11 AC 17 ms
6,940 KB
testcase_12 AC 232 ms
19,200 KB
testcase_13 AC 213 ms
19,080 KB
testcase_14 AC 72 ms
23,168 KB
testcase_15 AC 90 ms
23,160 KB
testcase_16 AC 143 ms
21,376 KB
testcase_17 AC 319 ms
18,560 KB
testcase_18 AC 302 ms
18,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i <= (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void _IN(T&... a){(cin>> ... >> a);}
template<class T> void _OUT(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void _OUT(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define INT(...) int __VA_ARGS__; _IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; _IN(__VA_ARGS__)
#define pcnt __builtin_popcountll
int ceil(int x,int y){return x/y+!!(x%y);}
int abs(int x,int y){return abs(x-y);}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const int INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
struct HLD {
    int N;
    vector<int> roots;
    vector<vector<int>> G;
    vector<int> parent,depth,sz,in,out,head,rev;
    int t = 0;
    HLD() {}
    HLD(int n, vector<int> r = {0}) : N(n), roots(r),G(N),parent(N),depth(N),sz(N),in(N),out(N),head(N),rev(N){}

    void add_edge(int u, int v) {
        assert(0 <= u && u < N);
        assert(0 <= v && v < N);
        G[u].push_back(v);
        G[v].push_back(u);
    }

    void dfs_sz(int u, int p, int d) {
        parent[u] = p;
        depth[u] = d;
        sz[u] = 1;
        if (G[u].size() && G[u][0] == p) swap(G[u][0], G[u].back());
        for (int& v : G[u]) if (v != p) {
            dfs_sz(v, u, d + 1);
            sz[u] += sz[v];
            if (sz[G[u][0]] < sz[v]) swap(G[u][0], v);
        }
    }

    void dfs_hld(int u, int p) {
        in[u] = t++;
        rev[in[u]] = u;
        for (const int& v : G[u]) if (v != p) {
            head[v] = (v == G[u][0] ? head[u] : v);
            dfs_hld(v, u);
        }
        out[u] = t;
    }

    void build() {
        for(auto r:roots){
            head[r] = r;
            dfs_sz(r, -1, 0);
            dfs_hld(r, -1);
        }
    }

    vector<pair<int,int>> query(int u,int v,bool edge){
        assert(0 <= u && u < N);
        assert(0 <= v && v < N);
        vector<pair<int,int>> res;
        while(true){
            if(in[u]>in[v])swap(u,v);
            if(head[u]==head[v])break;
            res.emplace_back(in[head[v]],in[v]);
            v = parent[head[v]];
        }
        
        res.emplace_back(in[u]+edge,in[v]);
        return res;
    }

    int vertex_idx(int u){return in[u];}
};
using S = long long;
using F = long long;

S op(S a, S b){ return std::min(a, b); }
S e(){ return INF; }
S mapping(F f, S x){ return f+x; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }
using lazy_seg = lazy_segtree<S,op,e,F,mapping,composition,id>;

int tousa_sum(int a,int d,int n){
    //初項a,公差d,項数nの等差数列の和
    return n*(2*a+(n-1)*d)/2;
}
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n);
    HLD G(n);
    rep(i,n-1){
        INT(u,v);
        --u;--v;
        G.add_edge(u,v);
    }
    G.build();
    lazy_seg seg(vi(n,0));
    INT(q);
    while(q--){
        INT(a,b);
        --a;--b;
        for(auto [l,r]:G.query(a,b,0)){
            seg.apply(l,r+1,1);
        }
    }
    int ans = 0;
    rep(i,n){
        ans += tousa_sum(1,1,seg.get(G.vertex_idx(i)));
    }
    cout<<ans<<endl;

    return 0;
}
0