Laskettelukeskus

#include <bits/stdc++.h>

using namespace std;

// Shorter types
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef pair<ll,ll> pll;
typedef vector<vll> adjList;
typedef vector<vector<pll>> adjwList;

// Macros
#define LOOP(i, start, end) for (ll i = start; i <= end; i++)
#define FE_LOOP(i, collection) LOOP(i, 0, collection.size()-1)
#define SORT(v) sort(v.begin(), v.end())
#define REV_SORT(v) sort(v.rbegin(), v.rend())

// Variables
ll n;
adjList adj;
vll needs;

void read_input(){
    cin >> n;
    needs = vll(n+1);
    adj = adjList(n+1, vll());
    LOOP(i, 0, n-2){
        ll a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        //adj[b].push_back(a);
    }
    LOOP(i, 1, n-1){
        cin >> needs[i];
    }
}

// Libs

// Solution
void solve(){
    queue<ll> q;
    q.push(1);
    vector<bool> visited(n+1, false);

    ll bestSum = 0;
    while (!q.empty()){
        ll node = q.front(); q.pop();
        visited[node] = true;

        ll sum = 0;
        for (ll child : adj[node]){
            if (visited[child]) continue;
            q.push(child);
            sum += needs[child];
        }
        bestSum = max(bestSum, sum);
    }
    cout << bestSum << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    read_input();
    solve();

    return 0;
}

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: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER