Laskettelukeskus

input/code.cpp: In function 'void solve()':
input/code.cpp:15:50: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | #define LOOP(i, start, end) for (ll i = start; i <= end; i++)
      |                                                  ^
input/code.cpp:16:32: note: in expansion of macro 'LOOP'
   16 | #define FE_LOOP(i, collection) LOOP(i, 0, collection.size()-1)
      |                                ^~~~
input/code.cpp:68:5: note: in expansion of macro 'FE_LOOP'
   68 |     FE_LOOP(i, lvlOrder){
      |     ^~~~~~~

#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
vector<pll> bfs(ll start){
    vector<pll> lvlOrder;

    vector<bool> visited(adj.size()+1, false);
    queue<pll> q;
    q.emplace(start, 0);

    while (!q.empty()){
        ll node = q.front().first; ll depth = q.front().second; q.pop();
        visited[node] = true;
        lvlOrder.emplace_back(node, depth);

        for (ll child : adj[node]){
            if (visited[child]) continue;
            q.emplace(child, depth+1);
        }
    }
    return lvlOrder;
}

// Solution
void solve(){
   auto lvlOrder = bfs(1);

    ll bestSum = 0;
    ll curDepth = 0;
    ll sum = 0;
    FE_LOOP(i, lvlOrder){
        auto p = lvlOrder[i];
        if (p.second != curDepth){
            curDepth ++;
            bestSum = max(bestSum, sum);
            sum = 0;
        }
        sum += needs[p.first];
    }

    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