Task: | Laskettelukeskus |
Sender: | Roopekt |
Submission time: | 2023-11-07 21:32:51 +0200 |
Language: | Rust |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 53 |
#2 | ACCEPTED | 47 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.04 s | 2 | details |
#5 | ACCEPTED | 0.04 s | 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.04 s | 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.04 s | 2 | details |
#10 | ACCEPTED | 0.00 s | 1, 2 | details |
#11 | ACCEPTED | 0.03 s | 2 | details |
#12 | ACCEPTED | 0.00 s | 1, 2 | details |
#13 | ACCEPTED | 0.03 s | 2 | details |
Code
#![recursion_limit = "120000"]use std::cmp::max;use std::io::stdin;#[derive(Clone, Debug)]struct Slope {children: Vec<usize>,plough_demand: u64}impl Slope {pub const DUMMY: Self = Self {children: Vec::new(),plough_demand: 0};}//possible stack overflowfn get_total_plough_demand(parent_index: usize, all_slopes: &Vec<Slope>) -> u64 {let demand_of_children: u64 = all_slopes[parent_index].children.iter().map(|&i| get_total_plough_demand(i, all_slopes)).sum();let demand_of_parent = all_slopes[parent_index].plough_demand;max(demand_of_children, demand_of_parent)}fn main() {let mut input = stdin().lines();let line = input.next().unwrap().unwrap();let slope_count: usize = line.parse().unwrap();let mut slopes = vec![Slope::DUMMY; slope_count];for line_result in (&mut input).take(slope_count - 1) {let line = line_result.unwrap();let mut indeces = line.split_whitespace().map(|s| s.parse().unwrap()).map(|i: usize| i - 1);let upper_slope_index = indeces.next().unwrap();let lower_slope_index = indeces.next().unwrap();slopes[upper_slope_index].children.push(lower_slope_index);}let line = input.next().unwrap().unwrap();let plough_demands = line.split_whitespace().map(|s| s.parse().unwrap());for (i, plough_demand) in plough_demands.enumerate() {slopes[i].plough_demand = plough_demand;}println!("{}", get_total_plough_demand(0, &slopes));}
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 |