#392396 (C++14) No.899 γatheree

• 問題: No.899 γatheree
• ユーザー: hitonanode
• 提出日時: 2019-10-22 23:35:47
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,125 ms / 2,000 ms
• コード長: 6,946 bytes
• コンパイル時間: 2,333 ms
• コンパイル使用メモリ: 195,872 KB
• 実行使用メモリ: 22,540 KB
• 最終ジャッジ日時: 2024-07-05 02:54:53
• 合計ジャッジ時間: 24,266 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	3 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	3 ms; 6,940 KB
testcase_06	AC	1,125 ms; 22,016 KB
testcase_07	AC	1,083 ms; 22,040 KB
testcase_08	AC	1,051 ms; 22,244 KB
testcase_09	AC	1,065 ms; 22,128 KB
testcase_10	AC	1,072 ms; 22,020 KB
testcase_11	AC	1,074 ms; 22,064 KB
testcase_12	AC	1,050 ms; 22,116 KB
testcase_13	AC	1,042 ms; 21,932 KB
testcase_14	AC	1,079 ms; 22,024 KB
testcase_15	AC	1,069 ms; 21,996 KB
testcase_16	AC	1,057 ms; 22,244 KB
testcase_17	AC	1,061 ms; 22,104 KB
testcase_18	AC	1,047 ms; 22,024 KB
testcase_19	AC	1,062 ms; 22,232 KB
testcase_20	AC	1,071 ms; 22,060 KB
testcase_21	AC	993 ms; 22,540 KB
testcase_22	AC	986 ms; 22,528 KB
testcase_23	AC	981 ms; 22,524 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
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){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

template <typename VAL, typename DVAL>
struct LazySegTree
{
    int N;
    int head;

    vector<VAL> val;
    vector<DVAL> dval;
    VAL I_val;
    DVAL I_dval;

    using vv2v = function<VAL(const VAL&, const VAL&)>;
    using d2d = function<void(DVAL&, const DVAL&)>;
    using d2v = function<void(VAL&, const DVAL&)>;
    vv2v merge_val;
    d2d add_dval;
    d2v refl_dval;

    LazySegTree(vector<VAL> &val_init, VAL val_default, DVAL dval_default,
                vv2v f, d2d dadd, d2v dreflect)
            : N(val_init.size()), I_val(val_default), I_dval(dval_default),
              merge_val(f),
              add_dval(dadd),
              refl_dval(dreflect)
    {
        int N_tmp = 1;
        while (N_tmp < N) N_tmp <<= 1;
        val = vector<VAL>(N_tmp*2, I_val);
        dval = vector<DVAL>(N_tmp*2, I_dval);
        head = N_tmp - 1;
        for (int i=0; i<N; i++) val[head+i] = val_init[i];
        for (int pos=head-1; pos>=0; pos--) val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
    }

    void resolve_dval(int pos, int l, int r) { // posで遅延を解消して子孫に押し付ける
        refl_dval(val[pos], dval[pos]);
        if (pos < head)
        {
            add_dval(dval[pos*2+1], dval[pos]);
            add_dval(dval[pos*2+2], dval[pos]);
        }
        dval[pos] = I_dval;
    }

    void update(int begin, int end, DVAL dval_q) { update(begin, end, dval_q, 0, 0, head+1); }
    void update(int begin, int end, DVAL dval_q, int pos, int l, int r)
    {
        // 後でリファクタリング
        if (begin <= l && r <= end) { // 担当区間全部使う
            add_dval(dval[pos], dval_q);
            resolve_dval(pos, l, r);
        }
        else if (begin < r && l < end) { // 少なくともどこかで交差
            resolve_dval(pos, l, r);
            update(begin, end, dval_q, pos*2+1, l, (l+r)/2);
            update(begin, end, dval_q, pos*2+2, (l+r)/2, r);
            val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
        }
        else resolve_dval(pos, l, r);
    }

    VAL getvalue(int begin, int end) { return getvalue(begin, end, 0, 0, head+1); }
    VAL getvalue(int begin, int end, int pos, int l, int r)
    {
        resolve_dval(pos, l, r);
        if (begin <= l && r <= end) return val[pos];
        else if (begin<r && l<end) {
            VAL vl = getvalue(begin, end, pos*2+1, l, (l+r)/2);
            VAL vr = getvalue(begin, end, pos*2+2, (l+r)/2, r);
            val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
            return merge_val(vl, vr);
        }
        else return I_val;
    }
};

int N;
vector<vector<int>> e;
vector<int> bfs_id;
vector<int> par;
vector<int> ch_begin, ch_end;
vector<vector<int>> e_ch;

void bfs(int root)
{
    queue<int> q;
    bfs_id.resize(N);
    par.resize(N);
    ch_begin.resize(N);
    ch_end.resize(N);
    e_ch.resize(N);

    q.push(root);
    int i = 0;
    bfs_id[root] = i++;
    par[root] = -1;
    while (!q.empty())
    {
        int now = q.front();
        q.pop();
        ch_begin[now] = i;
        for (auto nxt : e[now]) if (nxt != par[now])
        {
            e_ch[now].push_back(nxt);
            bfs_id[nxt] = i++;
            par[nxt] = now;
            q.push(nxt);
        }
        ch_end[now] = i;
    }
}

int main()
{
    cin >> N;
    e.resize(N);
    REP(_, N - 1)
    {
        int u, v;
        cin >> u >> v;
        e[u].emplace_back(v);
        e[v].emplace_back(u);
    }
    bfs(0);
    vector<lint> A(N);
    cin >> A;
    vector<lint> v(N);
    REP(i, N) v[bfs_id[i]] = A[i];
    using pib = pair<lint, bool>;
    LazySegTree<lint, pib> lst1(v, 0, pib(0, false),
                               [](lint a, lint b) { return a + b; },
                               [](pib &a, pib b) {if (b.second) a = b; },
                               [](lint &a, pib b) {if (b.second) a = b.first; });
    int Q;
    cin >> Q;
    REP(_, Q)
    {
        int x;
        cin >> x;
        int x_id = bfs_id[x];

        lint ret = lst1.getvalue(x_id, x_id + 1);
        lst1.update(x_id, x_id + 1, pib(0, 1));

        int p = par[x];
        if (p != -1)
        {
            int pp = par[p];
            if (pp != -1)
            {
                int pp_id = bfs_id[pp];
                ret += lst1.getvalue(pp_id, pp_id + 1);
                lst1.update(pp_id, pp_id + 1, pib(0, 1));
            }
            int p_id = bfs_id[p];
            ret += lst1.getvalue(p_id, p_id + 1);
            lst1.update(p_id, p_id + 1, pib(0, 1));
            int cp_id_begin = ch_begin[p], cp_id_end = ch_end[p];
            ret += lst1.getvalue(cp_id_begin, cp_id_end);
            lst1.update(cp_id_begin, cp_id_end, pib(0, 1));
        }

        {
            int c_id_begin = ch_begin[x], c_id_end = ch_end[x];
            ret += lst1.getvalue(c_id_begin, c_id_end);
            lst1.update(c_id_begin, c_id_end, pib(0, 1));
        }

        if (e_ch[x].size()) {
            int cc_id_begin = ch_begin[e_ch[x].front()], cc_id_end = ch_end[e_ch[x].back()];
            ret += lst1.getvalue(cc_id_begin, cc_id_end);
            lst1.update(cc_id_begin, cc_id_end, pib(0, 1));
        }
        cout << ret << endl;
        lst1.update(x_id, x_id + 1, pib(ret, 1));
    }
}