Laskettelukeskus

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();
    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]);
        }
    }
    needs = newneeds.clone();
    print!("{:?}", needs[0]);
}

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 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER