CSES - Datatähti 2024 qualification mirror - Results
Submission details
Task:Laskettelukeskus
Sender:saile0815
Submission time:2023-10-30 19:34:56 +0200
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED53
#2ACCEPTED47
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.13 s2details
#5ACCEPTED0.13 s2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.10 s2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.12 s2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.12 s2details
#12ACCEPTED0.01 s1, 2details
#13ACCEPTED0.12 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:30:10: warning: unused variable 'input_char' [-Wunused-variable]
   30 |     char input_char[n];
      |          ^~~~~~~~~~

Code

#include <bits/stdc++.h>

# define NMAX 100001

std::vector<uint64_t> adjacent_v[NMAX];
uint64_t n;
uint64_t weights[NMAX];
bool visited[NMAX];


uint64_t dfs(uint64_t node) {

    uint64_t max_val = 0;

    visited[node] = true;
    for (auto u: adjacent_v[node]) {
        if(visited[u] == true){
            continue;
        } else
        {
            max_val += dfs(u);
        }         
    }
    return std::max(max_val, weights[node]);
}

int main() {

    std::cin >> n;
    char input_char[n];

    uint64_t a, b;

    for (size_t i = 0; i < n - 1; i++)
    {
        std::cin >> a >> b;
        adjacent_v[a-1].push_back(b-1);
    }

    for (size_t i = 0; i < n; i++)
    {
        std::cin >> weights[i];
    }
    

    for (size_t i = 0; i < n; i++)
    {
        visited[i] = false;
    }


    uint64_t max_val = dfs(0);
    
    std::cout << max_val << std::endl;
}

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: ACCEPTED

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

correct output
28399367694319

user output
28399367694319

Test 5

Group: 2

Verdict: ACCEPTED

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

correct output
28546840313799

user output
28546840313799

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: ACCEPTED

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

correct output
26053917212428

user output
26053917212428

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: ACCEPTED

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

correct output
50000000000000

user output
50000000000000