Laskettelukeskus

input/code.cpp: In function 'int main()':
input/code.cpp:47:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<Slope*> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |         if (depths.size()-1 < newd) {
      |             ~~~~~~~~~~~~~~~~^~~~~~
input/code.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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

typedef unsigned long long int ll;

struct Slope {
    ll value;
    int depth;
    vector<Slope*> children;
};

ll answer;

int main() {
    freopen("input.txt", "r", stdin);

    int n;
    cin >> n;
    vector<pair<int, int>> paths;
    vector<Slope> slopes;
    vector<vector<Slope*>> depths = { {} };
    for (int i = 0; i < n-1; ++i) {
        pair<int, int> path;
        cin >> path.first;
        cin >> path.second;
        paths.push_back(path);
    }
    for (int i = 0; i < n; ++i) {
        Slope slope;
        cin >> slope.value;
        slopes.push_back(slope);
    }
    slopes[0].depth = 0;
    int i = 0;
    int maxd = 0;
    depths[0].push_back(&slopes[0]);
    for (pair<int, int> path : paths) {
        int parent = path.first-1;
        int child = path.second-1;
        int newd = slopes[parent].depth + 1;
        slopes[child].depth = newd;
        if (newd > maxd) {
            maxd = newd;
        }
        slopes[parent].children.push_back(&slopes[child]);
        if (depths.size()-1 < newd) {
            depths.push_back({ &slopes[child] });
        }
        else {
            depths[newd].push_back(&slopes[child]);
        }
        ++i;
    }
    for (int i = maxd; i >= 0; --i) {
        vector<Slope*> dslopes = depths[i];
        for (Slope *slope : dslopes) {
            ll under = 0;
            for (Slope* child : slope->children) {
                under += child->value;
            }
            slope->value = max(under, slope->value);
        }
    } 
    ll answer = depths[0][0]->value;
    cout << answer << "\n";
}

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

Test 4

Group: 2

Verdict: RUNTIME ERROR

Test 5

Group: 2

Verdict: RUNTIME ERROR

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

Test 11

Group: 2

Verdict: RUNTIME ERROR

Test 12

Group: 1, 2

Verdict: RUNTIME ERROR

Test 13

Group: 2

Verdict: RUNTIME ERROR