Laskettelukeskus

input/code.cpp: In function 'int main()':
input/code.cpp:45:9: warning: unused variable 'currentNode' [-Wunused-variable]
   45 |     int currentNode = 0;
      |         ^~~~~~~~~~~
input/code.cpp: In function 'int recursiveSearch(Node)':
input/code.cpp:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int i = 0; i < node.neighborNodes.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
In member function 'Node& Node::operator=(Node&&)',
    inlined from 'int main()' at input/code.cpp:26:24:
input/code.cpp:7:7: warning: '<anonymous>.Node::snowAmount' is used uninitialized [-Wuninitialized]
    7 | class Node
      |       ^~~~
input/code.cpp: In function 'int main()':
input/code.cpp:26:24: note: '<anonymous>' declared here
   26 |     nodeList[0] = Node();
      |                        ^
In copy constructor 'Node::Node(const Node&)',
    i...

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

class Node;

class Node
{
public:
    int snowAmount;
    vector<Node> neighborNodes = vector<Node>();
    Node() {

    }
};

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

int main()
{
    cin >> 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();
        nodeList[number1 - 1].neighborNodes.push_back(nodeValue);
        nodeList[number2 - 1] = nodeValue;
    }

    for (int i = 0; i < numberOfNodes; ++i) {
        int number;
        cin >> number;
        nodeList[i].snowAmount = number;
    }

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

    cout << ans << endl;

    return 0;
}

int recursiveSearch(Node node)
{
    cout << "node snow amount is " << node.snowAmount << " has " << node.neighborNodes.size() << " neighbor nodes" << endl;

    int snowPlowsNeededBelow = 0;

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

    return max(snowPlowsNeededBelow, node.snowAmount);
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

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

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

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