Laskettelukeskus

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, q, m, a, b, c;
vector<pair<int,int>> v[202020];
int e[202020];
int d[202020];
int p[202020];
pair<int,int> r[202020];
set<int> se;
string s;

ll haku(int s, int syv) {
	d[s]=syv;
	ll ret=p[s];
	ll comp=0;
	for (auto u: v[s]) {
		comp+=haku(u.first,syv+1);
	}
	return max(comp, ret);
}


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;

	a=5; b=6;
	for (int i=2; i<=n; i++) {
		cin >> a >> b;
		r[i]={a,b};
        }
	cin >> p[1];
	ll aurat=p[1];
	for (int i=2; i<=n; i++) {
		cin >> p[i];
		v[r[i].first].push_back({r[i].second,p[i]});
	}
	aurat=haku(1,0);
	cout << aurat << "\n";
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED