Laskettelukeskus

input/code.cpp: In function 'int main()':
input/code.cpp:34:9: warning: unused variable 'currentNode' [-Wunused-variable]
   34 |     int currentNode = 0;
      |         ^~~~~~~~~~~

#include <iostream>
using namespace std;

int numberOfNodes;
int currentNode;
pair<int, int>* nodeList;
int* snowAmount;

int recursiveSearch();

int main()
{
    cin >> numberOfNodes;

    nodeList = new pair<int, int>[numberOfNodes]();
    nodeList[0] = make_pair(0, 0);

    snowAmount = new int[numberOfNodes];

    for (int i = 1; i < numberOfNodes; ++i) {
        int number1;
        int number2;
        cin >> number1;
        cin >> number2;
        // make it so that the first node is number 0
        nodeList[i] = make_pair(number1 - 1, number2 - 1);
    }
    for (int i = 0; i < numberOfNodes; ++i) {
        int number;
        cin >> number;
        snowAmount[i] = number;
    }

    int currentNode = 0;
    int ans = recursiveSearch();

    cout << ans << endl;

    return 0;
}

int recursiveSearch()
{
    //cout << "started at node " << currentNode << endl;
    int nodeAtStart = currentNode;

    // is the last node
    if (numberOfNodes <= nodeAtStart + 1) {
        //cout << numberOfNodes << " " << nodeAtStart << endl;
        //cout << "at start node " << nodeAtStart << " reached array end" << endl;
        return snowAmount[nodeAtStart];
    }

    // the next node is not from the current node
    if (nodeList[currentNode + 1].first != nodeAtStart) {
        //cout << nodeList[currentNode + 1].first << " " << nodeAtStart << endl;
        //cout << "at start node " << nodeAtStart << " no next nodes" << endl;
        return snowAmount[nodeAtStart];
    }

    int totalSnowUnder = 0;
    // while the next node is from current node
    while (nodeList[currentNode + 1].first == nodeAtStart) {

        // increment to the node we are trying to find
        currentNode++;
        //cout << "from node " << nodeAtStart << " found node " << currentNode << endl;
        totalSnowUnder += recursiveSearch();
    }

    return max(totalSnowUnder, snowAmount[nodeAtStart]);
}

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

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