CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:cppbetter
Submission time:2023-10-30 20:51:32 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.00 s2details
#50.00 s2details
#6ACCEPTED0.00 s1, 2details
#70.00 s2details
#80.00 s1, 2details
#90.01 s2details
#100.00 s1, 2details
#110.00 s2details
#120.00 s1, 2details
#130.00 s2details

Code

#include <iostream>

using namespace std;

int t = 0;

struct rin
{
    rin* up = nullptr;
    int left = 0;
    int nleft = 0;
    bool down = false;

    void upd(int x)
    {
        if(!up)
            t += x;

        left -= x;
        if (up)
            up->upd(x);
    }

    void upd2(int x)
    {
        if (!up)
            t += x;
        else
        {
            nleft = x;

            int dx = x;

            if (up->nleft > 0)
            {
                dx = min(0, x - up->nleft);
                up->nleft = max(0, up->nleft - x);
            }

            left -= x;
            if (dx)
                up->upd2(dx);
        }
    }
};

int main()
{
    rin rinL[1002];
    
    int n;
    cin >> n;

    for (int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        rinL[b].up = &rinL[a];
        rinL[a].down = true;
    }

    for (int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        rinL[a].left = a;
    }

    for (int i = 0; i < n; i++)
    {
        auto& r = rinL[i];
        if (r.down == false)
            r.upd(r.left);
    }

    for (int i = 0; i < n; i++)
    {
        auto& r = rinL[i];
        if (r.left > 0)
            r.upd(r.left);
    }

    cout << t;

    return 0;
}

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:

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

correct output
2675

user output
1699

Test 3

Group: 1, 2

Verdict:

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

correct output
2808

user output
2010

Test 4

Group: 2

Verdict:

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

correct output
28399367694319

user output
(empty)

Test 5

Group: 2

Verdict:

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

correct output
28546840313799

user output
(empty)

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:

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

correct output
0

user output
(empty)

Test 8

Group: 1, 2

Verdict:

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

correct output
100

user output
0

Test 9

Group: 2

Verdict:

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

correct output
1000000000

user output
(empty)

Test 10

Group: 1, 2

Verdict:

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

correct output
2809

user output
2457

Test 11

Group: 2

Verdict:

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

correct output
26053917212428

user output
(empty)

Test 12

Group: 1, 2

Verdict:

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

correct output
5000

user output
0

Test 13

Group: 2

Verdict:

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

correct output
50000000000000

user output
(empty)