結果

問題 No.399 動的な領主
ユーザー anta
提出日時 2016-07-15 22:46:28
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 4,048 bytes
コンパイル時間 2,298 ms
コンパイル使用メモリ 176,548 KB
実行使用メモリ 12,368 KB
最終ジャッジ日時 2024-11-07 19:06:29
合計ジャッジ時間 4,002 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }
vector<int> t_parent;
vi t_ord;
void tree_getorder(const vector<vi> &g, int root) {
    int n = g.size();
    t_parent.assign(n, -1);
    t_ord.clear();
    vector<int> stk; stk.push_back(root);
    while(!stk.empty()) {
        int i = stk.back(); stk.pop_back();
        t_ord.push_back(i);
        for(int j = (int)g[i].size() - 1; j >= 0; j --) {
            int c = g[i][j];
            if(t_parent[c] == -1 && c != root)
                stk.push_back(c);
            else
                t_parent[i] = c;
        }
    }
}
class SchieberVishkinLCA {
public:
    typedef unsigned Word;
    typedef int Vertex;
private:
    static inline Word lowestOneBit(Word v) {
        return v & (~v + 1);
    }
    static inline Word highestOneBitMask(Word v) {
        v |= v >> 1; v |= v >> 2; v |= v >> 4; v |= v >> 8; v |= v >> 16;
        return v >> 1;
    }
    std::vector<Word> indices;          //Vertex -> index
    std::vector<Word> maxHIndices;      //Vertex -> index
    std::vector<Word> ancestorHeights;  //Vertex -> Word
    std::vector<Vertex> pathParents;    //index-1 -> Vertex
public:
    void build(const std::vector<Vertex> &preorder, const std::vector<Vertex> &parents, Vertex root) {
        Vertex N = static_cast<Vertex>(preorder.size());
        ancestorHeights.resize(N);
        maxHIndices.resize(N);
        indices.resize(N);
        pathParents.resize(N);
        for(Vertex ix = 0; ix < N; ++ ix)
            indices[preorder[ix]] = ix + 1;
        for(Vertex i = 0; i < N; ++ i)
            maxHIndices[i] = indices[i];
        for(Vertex ix = N - 1; ix > 0; -- ix) {
            Vertex v = preorder[ix], parent = parents[v];
            if(lowestOneBit(maxHIndices[parent]) < lowestOneBit(maxHIndices[v]))
                maxHIndices[parent] = maxHIndices[v];
        }
        ancestorHeights[root] = 0;
        for(Vertex ix = 1; ix < N; ++ ix) {
            Vertex v = preorder[ix], parent = parents[v];
            ancestorHeights[v] = ancestorHeights[parent] | lowestOneBit(maxHIndices[v]);
        }
        pathParents[0] = root;
        for(Vertex ix = 1; ix < N; ++ ix) {
            Vertex v = preorder[ix], parent = parents[v];
            if(maxHIndices[v] != maxHIndices[parent])
                pathParents[indices[v] - 1] = parent;
            else
                pathParents[indices[v] - 1] = pathParents[indices[parent] - 1];
        }
    }
    Vertex query(Vertex v, Vertex u) const {
        Word Iv = maxHIndices[v], Iu = maxHIndices[u];
        Word hIv = lowestOneBit(Iv), hIu = lowestOneBit(Iu);
        Word hbMask = highestOneBitMask((Iv ^ Iu) | hIv | hIu);
        Word j = lowestOneBit(ancestorHeights[v] & ancestorHeights[u] & ~hbMask);
        Vertex x, y;
        if(j == hIv) x = v;
        else {
            Word kMask = highestOneBitMask(ancestorHeights[v] & (j - 1));
            x = pathParents[(indices[v] & ~kMask | (kMask + 1)) - 1];
        }
        if(j == hIu) y = u;
        else {
            Word kMask = highestOneBitMask(ancestorHeights[u] & (j - 1));
            y = pathParents[(indices[u] & ~kMask | (kMask + 1)) - 1];
        }
        return indices[x] < indices[y] ? x : y;
    }
};
int main() {
    int N;
    while(~scanf("%d", &N)) {
        vector<vector<int> > g(N);
        for(int i = 0; i < N - 1; ++ i) {
            int u, v;
            scanf("%d%d", &u, &v), -- u, -- v;
            g[u].push_back(v);
            g[v].push_back(u);
        }
        tree_getorder(g, 0);
        SchieberVishkinLCA lca;
        lca.build(t_ord, t_parent, 0);
        vector<int> cnt(N);
        int Q;
        scanf("%d", &Q);
        rep(ii, Q) {
            int A; int B;
            scanf("%d%d", &A, &B), -- A, -- B;
            int C = lca.query(A, B);
            ++ cnt[A];
            ++ cnt[B];
            if(C != 0) -- cnt[t_parent[C]];
            -- cnt[C];
        }
        for(int ix = (int)t_ord.size() - 1; ix > 0; -- ix) {
            int i = t_ord[ix], p = t_parent[i];
            cnt[p] += cnt[i];
        }
        ll ans = 0;
        rep(i, N) {
            int n = cnt[i];
            ans += (ll)n * (n + 1) / 2;
        }
        printf("%lld\n", ans);
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0