Laskettelukeskus

#include <bits/stdc++.h>
 
using namespace std;
 
int n, p = 0, a[100001];
int v[100001];

void auraus(int s) {
	a[s]--;
	if (s > 1) auraus(v[s]);
}

int main() {
	cin >> n;
 
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		v[b] = a;
	}
 
	for (int i = 1; i <= n; i++) cin >> a[i]; 

	if (n == 1) {
		p = a[1];
		goto end;
	}
 
	for (int i = n; i > 0; i--) {
		while (a[i] > 0) {
			if (!(v[i] > 0) && i != 1) break;
			auraus(i);
			p++;
		}
	} 

end:
	cout << p;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED