CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:Username*
Submission time:2023-11-01 17:25:29 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#80.00 s1, 2details
#90.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#120.00 s1, 2details
#130.00 s1, 2details
#140.00 s1, 2details
#150.00 s1, 2details
#160.00 s2details
#170.00 s2details
#180.00 s2details
#190.00 s2details
#200.00 s2details
#210.00 s2details
#220.00 s2details
#230.00 s2details
#240.00 s2details

Compiler report

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) {
      |             ~~~~~~~~~~~~~~~~^~~~~~

Code

#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 details

Test 1

Group: 1, 2

Verdict:

input
5 6 13
1 1 K
5 1 K
2 2 H
4 2 H
...

correct output
-16

user output
(empty)

Test 2

Group: 1, 2

Verdict:

input
5 6 7
1 5 K
4 6 K
2 4 H
2 5 H
...

correct output
0

user output
(empty)

Test 3

Group: 1, 2

Verdict:

input
5 6 7
5 5 K
2 6 K
2 4 H
2 5 H
...

correct output
0

user output
(empty)

Test 4

Group: 1, 2

Verdict:

input
10 10 51
3 3 H
6 3 H
9 5 H
5 10 H
...

correct output
50

user output
(empty)

Test 5

Group: 1, 2

Verdict:

input
10 10 52
3 5 H
3 1 H
9 6 H
2 8 H
...

correct output
40

user output
(empty)

Test 6

Group: 1, 2

Verdict:

input
10 10 60
6 10 H
2 8 H
5 8 H
8 10 H
...

correct output
-15

user output
(empty)

Test 7

Group: 1, 2

Verdict:

input
10 10 60
4 7 H
7 4 H
4 10 H
3 6 H
...

correct output
60

user output
(empty)

Test 8

Group: 1, 2

Verdict:

input
10 10 40
9 9 H
5 10 H
5 6 H
4 9 H
...

correct output
2

user output
(empty)

Test 9

Group: 1, 2

Verdict:

input
1 1 0

correct output
0

user output
1

Test 10

Group: 1, 2

Verdict:

input
1 1 1
1 1 K

correct output
0

user output
1

Test 11

Group: 1, 2

Verdict:

input
1 1 1
1 1 H

correct output
0

user output
1

Test 12

Group: 1, 2

Verdict:

input
10 5 32
10 3 H
4 4 H
3 3 H
5 4 H
...

correct output
20

user output
(empty)

Test 13

Group: 1, 2

Verdict:

input
5 10 32
5 9 H
2 4 H
2 9 H
2 5 H
...

correct output
28

user output
(empty)

Test 14

Group: 1, 2

Verdict:

input
10 10 100
2 9 H
5 4 H
5 9 K
6 1 K
...

correct output
-439

user output
(empty)

Test 15

Group: 1, 2

Verdict:

input
10 10 100
8 9 H
5 10 H
5 4 H
3 9 H
...

correct output
88

user output
(empty)

Test 16

Group: 2

Verdict:

input
500 500 125000
125 261 K
84 78 K
11 200 K
481 246 K
...

correct output
-624270

user output
(empty)

Test 17

Group: 2

Verdict:

input
500 500 125100
16 61 H
37 62 H
459 125 H
318 476 H
...

correct output
124020

user output
(empty)

Test 18

Group: 2

Verdict:

input
500 500 249999
22 214 H
356 145 H
341 29 H
393 262 H
...

correct output
249999

user output
(empty)

Test 19

Group: 2

Verdict:

input
500 500 32000
30 81 H
315 34 H
78 112 H
367 166 H
...

correct output
10126

user output
(empty)

Test 20

Group: 2

Verdict:

input
500 500 126745
164 390 H
126 331 H
164 126 H
55 92 H
...

correct output
-104692

user output
(empty)

Test 21

Group: 2

Verdict:

input
500 500 71200
106 191 H
314 189 H
482 485 H
344 401 H
...

correct output
-335853

user output
(empty)

Test 22

Group: 2

Verdict:

input
500 500 67772
421 277 H
428 470 H
169 142 H
256 345 H
...

correct output
-208567

user output
(empty)

Test 23

Group: 2

Verdict:

input
500 500 27434
366 481 H
38 22 H
126 107 H
135 169 H
...

correct output
-57100

user output
(empty)

Test 24

Group: 2

Verdict:

input
500 500 93982
183 13 H
463 230 H
264 351 H
399 290 H
...

correct output
-52800

user output
(empty)