#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template vector sort_unique(vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template istream &operator>>(istream &is, vector &vec) { for (auto &v : vec) is >> v; return is; } template ostream &operator<<(ostream &os, const vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template istream &operator>>(istream &is, tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template ostream &operator<<(ostream &os, const tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template ostream &operator<<(ostream &os, const deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const pair &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template ostream &operator<<(ostream &os, const map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr) #else #define dbg(x) (x) #define dbgif(cond, x) 0 #endif // Preorder Euler Tour // (行きがけ順,部分木の頂点クエリ等に有用) struct PreorderEulerTour { int V; // # of vertices of tree int root; std::vector> edges; std::vector subtree_begin, subtree_end; std::vector vis_order; void _build_dfs(int now, int prv) { subtree_begin[now] = vis_order.size(); vis_order.push_back(now); for (auto nxt : edges[now]) if (nxt != prv) _build_dfs(nxt, now); subtree_end[now] = vis_order.size(); } PreorderEulerTour() = default; PreorderEulerTour(const std::vector> &to, int root) : V(to.size()), root(root), edges(to) { assert(root >= 0 and root < V); subtree_begin.resize(V); subtree_end.resize(V); _build_dfs(root, -1); } }; int main() { int N; cin >> N; vector> to(N); FOR(i, 1, N) { int p; cin >> p; p--; to[p].push_back(i); } dbg(to); vector A(N); vector B(N); cin >> A >> B; const int root = 0; PreorderEulerTour tour(to, root); vector ids(N); iota(ALL(ids), 0); sort(ALL(ids), [&](int i, int j) { return A[i] > A[j]; }); map se; dbg(ids); vector dp0(N); for (auto i : ids) { lint ret0 = B[i]; for (auto j : to[i]) { auto itr = se.lower_bound(tour.subtree_begin[j]); while (true) { if (itr == se.end() or itr->first >= tour.subtree_end[j]) break; ret0 += itr->second; se.erase(itr); itr = se.lower_bound(tour.subtree_begin[j]); } } auto itr = se.lower_bound(tour.subtree_begin[i]); bool add = true; if (itr != se.begin()) { int j = tour.vis_order[prev(itr)->first]; if (tour.subtree_begin[j] < tour.subtree_begin[i] and tour.subtree_begin[i] < tour.subtree_end[j]) { if (se[tour.subtree_begin[j]] > ret0) { add = false; } else { dbg(j); dbg(se); se.erase(tour.subtree_begin[j]); } } } dp0[i] = ret0; if (add) se[tour.subtree_begin[i]] = ret0; } // vector tmp(N); // REP(i, N) tmp[i] = rmq.get(i, i + 1); dbg(dp0); auto ord = tour.vis_order; reverse(ALL(ord)); vector rmq_rootfree(N); for (auto i : ord) { for (auto j : to[i]) { rmq_rootfree[i] += rmq_rootfree[j]; } chmax(rmq_rootfree[i], dp0[i]); } dbg(rmq_rootfree); cout << rmq_rootfree[root] << '\n'; }