CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:Username*
Submission time:2023-10-31 16:13:40 +0200
Language:C++ (C++11)
Status:READY
Result:53
Feedback
groupverdictscore
#1ACCEPTED53
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#40.14 s2details
#50.13 s2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.10 s2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.14 s2details
#10ACCEPTED0.00 s1, 2details
#110.12 s2details
#12ACCEPTED0.00 s1, 2details
#130.13 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:45:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<Slope*> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |         if (depths.size()-1 < newd) {
      |             ~~~~~~~~~~~~~~~~^~~~~~

Code

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

typedef long long ll;

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

int answer;

int main() {
    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);
        }
    }
    answer = depths[0][0]->value;
    cout << answer << "\n";
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
5
1 2
1 3
3 4
3 5
...

correct output
6

user output
6

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
100
1 73
1 64
64 23
1 88
...

correct output
2675

user output
2675

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
100
1 36
36 56
56 59
36 97
...

correct output
2808

user output
2808

Test 4

Group: 2

Verdict:

input
100000
1 45452
1 74209
45452 78960
45452 79820
...

correct output
28399367694319

user output
1043933167

Test 5

Group: 2

Verdict:

input
100000
1 31165
1 23263
31165 89516
31165 53122
...

correct output
28546840313799

user output
-1807302713

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
100
1 79
79 9
79 45
45 10
...

correct output
0

user output
0

Test 7

Group: 2

Verdict: ACCEPTED

input
100000
1 66038
1 56789
56789 7403
66038 69542
...

correct output
0

user output
0

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
100
1 2
2 3
3 4
4 5
...

correct output
100

user output
100

Test 9

Group: 2

Verdict: ACCEPTED

input
100000
1 2
2 3
3 4
4 5
...

correct output
1000000000

user output
1000000000

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
100
1 2
1 3
2 4
2 5
...

correct output
2809

user output
2809

Test 11

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
26053917212428

user output
645594892

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
100
1 2
1 3
2 4
2 5
...

correct output
5000

user output
5000

Test 13

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
50000000000000

user output
-2009260032