#609929 (C++17) No.899 γatheree

• 問題: No.899 γatheree
• ユーザー: blackyuki
• 提出日時: 2021-01-24 18:30:22
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 5,190 bytes
• コンパイル時間: 2,257 ms
• コンパイル使用メモリ: 210,836 KB
• 最終ジャッジ日時: 2025-01-18 07:55:54
• ジャッジサーバーID （参考情報）: judge5 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 21 WA * 2

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vpp=vector<PP>;
using vb=vector<bool>;
using vvb=vector<vb>;
using vvvb=vector<vvb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
ll ans=0;
class segtree{
    ll N=1;
    vi segsum,lazy;
public:
    segtree(vi v){
        while(N<v.size())N*=2;
        segsum=vi(N*2-1);
        lazy=vi(N*2-1,-inf);
        rep(i,N){
            if(i<v.size())segsum[i+N-1]=v[i];
            else segsum[i+N-1]=0;
        }
        for(int i=N-2;i>=0;i--)segsum[i]=segsum[i*2+1]+segsum[i*2+2];
    }
    segtree(ll n,ll k){
        while(N<n)N*=2;
        segsum=vi(N*2-1);
        lazy=vi(N*2-1,-inf);
        rep(i,N){
            if(i<n)segsum[i+N-1]=k;
            else segsum[i+N-1]=0;
        }
        for(int i=N-2;i>=0;i--)segsum[i]=segsum[i*2+1]+segsum[i*2+2];
    }
    void eval(int k,int l,int r){
        if(lazy[k]==-inf)return;
        segsum[k]=lazy[k];
        if(r-l>1){
            lazy[k*2+1]=lazy[k]/2;
            lazy[k*2+2]=lazy[k]/2;
        }
        lazy[k]=-inf;
    }
    void update(ll x,int a,int b,int k=0,int l=0,int r=-1){
        if(r==-1)r=N;
        eval(k,l,r);
        if(r<=a||b<=l)return;
        if(a<=l&&r<=b){
            lazy[k]=x*(r-l);
            eval(k,l,r);
        }
        else{
            update(x,a,b,k*2+1,l,(l+r)/2);
            update(x,a,b,k*2+2,(l+r)/2,r);
            segsum[k]=segsum[k*2+1]+segsum[k*2+2];
        }
    }
    ll getsum(int a,int b,int k=0,int l=0,int r=-1){
        if(r==-1)r=N;
        eval(k,l,r);
        if(a<=l&&r<=b)return segsum[k];
        if(r<=a||b<=l)return 0;
        ll c1=getsum(a,b,k*2+1,l,(l+r)/2);
        ll c2=getsum(a,b,k*2+2,(l+r)/2,r);
        return c1+c2;
    }
    ll query(ll a,ll b){
        ll res=getsum(a,b);update(0,a,b);
        return res;
    }
};
int main(){
    ll n;cin>>n;
    vvi g(n);
    rep(i,n-1){
        ll a,b;cin>>a>>b;
        g[a].pb(b);g[b].pb(a);
    }
    vi id(n),par(n,-1);
    vvi L(2,vi(n,inf)),R(2,vi(n,-1));
    ll c=0;
    queue<ll> q;q.push(0);
    while(!q.empty()){
        ll i=q.front();q.pop();
        id[i]=c++;
        if(par[i]!=-1){
            chmin(L[0][par[i]],id[i]);
            chmax(R[0][par[i]],id[i]);
        }
        if(par[i]!=-1&&par[par[i]]!=-1){
            chmin(L[1][par[par[i]]],id[i]);
            chmax(R[1][par[par[i]]],id[i]);
        }
        for(ll x:g[i])if(x!=par[i]){
            par[x]=i;q.push(x);
        }
    }
    vi v(n);rep(i,n)cin>>v[i];
    vi V(n);rep(i,n)V[id[i]]=v[i];
    ll Q;cin>>Q;
    segtree seg(V);
    rep(qq,Q){
        ll i;cin>>i;
        ll ans=0;
        ans+=seg.query(L[1][i],R[1][i]+1);
        ans+=seg.query(L[0][i],R[0][i]+1);
        if(par[i]!=-1){
            ll p=par[i];
            ans+=seg.query(L[0][p],R[0][p]+1);
            ans+=seg.query(id[p],id[p]+1);
            if(par[p]!=-1)ans+=seg.query(id[par[p]],id[par[p]]+1);
        }
        out(ans);
        seg.update(ans,id[i],id[i]+1);
    }
}