Submission #73565861

---

Source Code Expand

//#region


#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

//数値型
using bl = bool;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using ld = long double;
constexpr ll INF = 8e18;
constexpr ll MOD = 1'000'000'007;
constexpr ll MOD2 = 998244353;
constexpr ld PI = 3.141592653589793;
//コンテナ
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using vbl = vc<bl>; using vvbl = vv<bl>; using vvvbl = vv<vbl>;
using vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;
using vs = vc<string>; using vvs = vv<string>;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using mii = map<int, int>; using mll = map<ll, ll>;
//マクロ
#define rep(i, limit) for(ll i = 0; i < (ll)limit; ++i)
#define REP(i ,limit) for(ll i = 0; i <= (ll)limit; ++i)
#define nfor(i, x, limit) for (ll i = (ll)x; i < (ll)limit; ++i)
#define NFOR(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; ++i)
#define drep2(i, m, n) for (ll i = (ll)(m)-1; i >= (ll)(n); --i)
#define drep(i, n) drep2(i, n, 0)
//配列vのサイズだけ入力を受け取る
template<class T>istream& operator>>(istream& i, vc<T>& v) { rep(j, size(v))i >> v[j]; return i; }
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define next_p(v) next_permutation(v.begin(),v.end())
#define el '\n'
#define spa " "
#define fi first
#define se second
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
//グリッド
vi dx = { 1,0,-1,0 }, dy = { 0,1,0,-1 }; //{下,右,上,左}
vi dx2={1,1,0,-1,-1,-1,0,1}, dy2={0,1,1,1,0,-1,-1,-1};
bool in_grid(ll i, ll j, ll h, ll w) {return (0 <= i && i < h && 0 <= j && j < w);}
bool out_grid(ll i, ll j, ll h, ll w) {return (!(0 <= i && i < h && 0 <= j && j < w));}
//行単位vector出力
#define v_cout(v){ll n = size(v);rep(ixxxx,n){cout<<v[ixxxx];if(ixxxx==n-1)cout<<el;else cout<<spa;}}
#define vv_cout(v){ll n = size(v);rep(ixxxx,n){rep(jxxxx,size(v[ixxxx])){cout<<v[ixxxx][jxxxx];if(jxxxx==(ll)size(v[ixxxx])-1)cout<<el;else cout<<spa;}}}
//空白無しver
#define vcout(v){ll n = size(v);rep(ixxxx,n){cout<<v[ixxxx];if(ixxxx==n-1)cout<<el;}}
#define vvcout(v){ll n = size(v);rep(ixxxx,n){rep(jxxxx,size(v[ixxxx])){cout<<v[ixxxx][jxxxx];if(jxxxx==(ll)size(v[ixxxx])-1)cout<<el;}}}

//#endregion



int main(){
  ll n, q;
  cin >> n >> q;
  vl v(n);
  cin >> v;
  vvl g(n);
  nfor(i,1,n){
    ll p;
    cin >> p;
    p--;
    g[p].push_back(i);
  }
  queue<ll> que;
  vl ans(n);
  auto push = [&] (ll nw) {
    ans[nw] += v[nw];
    que.push(nw);
  };

  push(0);
  while(que.size()){
    ll nw = que.front(); que.pop();
    for(ll nx : g[nw]) {
      ans[nx] += ans[nw];
      push(nx);
    }
  }
  while(q--){
    ll x;
    cin >> x;
    x--;
    cout << ans[x] << el;
  }
}

Submission Info

Judge Result