Laskettelukeskus

input/code.cpp: In function 'int main()':
input/code.cpp:52:9: warning: unused variable 'currentNode' [-Wunused-variable]
   52 |     int currentNode = 0;
      |         ^~~~~~~~~~~
input/code.cpp: In function 'long long int recursiveSearch(Node)':
input/code.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < node.neighborNodesIndex.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
using namespace std;

class Node;

class Node
{
public:
    int slopeIndex = 0;
    vector<int> neighborNodesIndex = vector<int>();
    Node() {

    }
};

long long recursiveSearch(Node node);
int numberOfNodes;
Node* nodeList;
long long* snowAmountList;

int main()
{
    cin >> numberOfNodes;

    snowAmountList = new long long[numberOfNodes];
    nodeList = new Node[numberOfNodes];
    nodeList[0] = Node();

    for (int i = 1; i < numberOfNodes; ++i) {
        // todo: dont always create new number
        int number1;
        int number2;
        cin >> number1;
        cin >> number2;
        Node nodeValue = Node();
        nodeValue.slopeIndex = number2 - 1;

        nodeList[number2 - 1] = nodeValue;

        nodeList[number1 - 1].neighborNodesIndex.push_back(number2 - 1);

        //cout << "added to node " << number1 - 1 << " node " << number2 - 1 << endl;
    }

    for (int i = 0; i < numberOfNodes; ++i) {
        long long number;
        cin >> number;
        snowAmountList[i] = number;
    }

    int currentNode = 0;
    long long ans = recursiveSearch(nodeList[0]);

    cout << ans << endl;

    return 0;
}

long long recursiveSearch(Node node)
{
    //cout << "index = " << node.slopeIndex << " node snow amount is " << snowAmountList[node.slopeIndex] <<  " has " << node.neighborNodesIndex.size() << " neighbor nodes" << endl;

    long long snowPlowsNeededBelow = 0;

    for (int i = 0; i < node.neighborNodesIndex.size(); ++i) {
        snowPlowsNeededBelow += recursiveSearch(nodeList[node.neighborNodesIndex[i]]);
    }

    return max(snowPlowsNeededBelow, snowAmountList[node.slopeIndex]);
}

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