Laskettelukeskus

#include <bits/stdc++.h>
 
using namespace std;
 
int n, p = 0, a[100001];
vector<int> v[100001];
 
void haku(int s) {
	for (int i = 0; i < (int)v[s].size(); i++) {
		if (v[v[s].at(i)].empty() && a[v[s].at(i)] <= 0) {
			v[s].erase(v[s].begin()+i);
		}
	}
 
	if (v[s].empty() && a[s] > 0) p++;
	
	if (v[s].empty()) {
		a[s] -= 1;
	} else {
		a[s] -= v[s].size();
	}
	
	for (auto u: v[s]) haku(u);
}
 
int main() {
	cin >> n;
 
	for (int i = 1; i < n; i++) {
		int a, b;
		cin >> a >> b;
		v[a].push_back(b);
	}
 
	for (int i = 1; i <= n; i++) cin >> a[i]; 

	while (!v[1].empty()) {
			haku(1);
	}

	if (v[1].empty() && a[1] > 0) {
		p += a[1];
	}
 
	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