CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:Dasuki
Submission time:2023-11-02 22:03:18 +0200
Language:Rust
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.05 s2details
#50.05 s2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.06 s2details
#100.00 s1, 2details
#110.04 s2details
#12ACCEPTED0.00 s1, 2details
#130.05 s2details

Compiler report

warning: value assigned to `needs` is never read
  --> input/code.rs:25:5
   |
25 |     needs = newneeds.clone();
   |     ^^^^^
   |
   = help: maybe it is overwritten before being read?
   = note: `#[warn(unused_assignments)]` on by default

warning: 1 warning emitted

Code

use std::{cmp::max, collections::HashMap, io};

fn main() {
    let n = input()[0];
    let mut abdict: HashMap<i32, Vec<i32>> = HashMap::new();
    for _ in 0..n - 1 {
        let ab = input();
        abdict.entry(ab[0]).or_insert(Vec::new()).push(ab[1]);
    }
    let mut needs = input();
    let mut newneeds = needs.clone();
    let mut needed_aurat = 0;
    for rinne in (1..n + 1).rev() {
        if abdict.contains_key(&rinne) {
            let children = abdict.get(&rinne).unwrap();
            let mut newneed = 0;
            for child in children {
                newneed += needs[(child - 1) as usize];
            }
            newneeds[(rinne - 1) as usize] = max(newneed, newneeds[(rinne - 1) as usize]);
        } else {
            needed_aurat += needs[(rinne - 1) as usize]
        }
    }
    needs = newneeds.clone();
    print!("{:?}", needed_aurat);
}

fn input() -> Vec<i32> {
    let mut x = String::new();
    io::stdin().read_line(&mut x).unwrap();
    x.trim()
        .split_whitespace()
        .map(|x| x.parse::<i32>().unwrap())
        .collect()
}

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
2225

Test 3

Group: 1, 2

Verdict:

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

correct output
2808

user output
2576

Test 4

Group: 2

Verdict:

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

correct output
28399367694319

user output
622515570

Test 5

Group: 2

Verdict:

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

correct output
28546840313799

user output
-1962571195

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:

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

correct output
2809

user output
2652

Test 11

Group: 2

Verdict:

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

correct output
26053917212428

user output
-1797807501

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