Task: | Laskettelukeskus |
Sender: | Dasuki |
Submission time: | 2023-11-02 23:27:12 +0200 |
Language: | Rust |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.07 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.27 s | 1, 2 | details |
#4 | TIME LIMIT EXCEEDED | -- | 2 | details |
#5 | TIME LIMIT EXCEEDED | -- | 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 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 2 | details |
#12 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#13 | TIME LIMIT EXCEEDED | -- | 2 | details |
Code
use std::{collections::HashMap, io}; fn main() { let n = input()[0]; let mut abdict: HashMap<usize, Vec<usize>> = 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 aurat: Vec<usize> = vec![0; n]; let mut requiredaurat: usize = 0; loop { if needs.iter().all(|&need| need == 0) { break; } aurat[0] += 1; requiredaurat += 1; if needs[0] > 0 { needs[0] -= 1; } let children = abdict .get(&1) .unwrap() .iter() .map(|&child| (child, needs[child - 1])) .collect::<HashMap<usize, usize>>(); let mut nextchild = children.iter().max_by_key(|child| child.1).unwrap().0 - 1; let mut parent = 0; loop { aurat[parent] -= 1; aurat[nextchild] += 1; if needs[nextchild] > 0 { needs[nextchild] -= 1; } if abdict.contains_key(&(nextchild + 1)) { let newchildren = abdict .get(&(nextchild + 1)) .unwrap() .iter() .map(|&child| (child, needs[child - 1])) .collect::<HashMap<usize, usize>>(); parent = nextchild.clone(); nextchild = newchildren.iter().max_by_key(|child| child.1).unwrap().0 - 1 } else { break; } } } println!("{}", requiredaurat) } fn input() -> Vec<usize> { let mut x = String::new(); io::stdin().read_line(&mut x).unwrap(); x.trim() .split_whitespace() .map(|x| x.parse::<usize>().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: WRONG ANSWER
input |
---|
100 1 73 1 64 64 23 1 88 ... |
correct output |
---|
2675 |
user output |
---|
115626 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 36 36 56 56 59 36 97 ... |
correct output |
---|
2808 |
user output |
---|
699887 |
Test 4
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1 45452 1 74209 45452 78960 45452 79820 ... |
correct output |
---|
28399367694319 |
user output |
---|
(empty) |
Test 5
Group: 2
Verdict: TIME LIMIT EXCEEDED
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: 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: TIME LIMIT EXCEEDED
input |
---|
100000 1 2 2 3 3 4 4 5 ... |
correct output |
---|
1000000000 |
user output |
---|
(empty) |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
2809 |
user output |
---|
8710 |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
26053917212428 |
user output |
---|
(empty) |
Test 12
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
5000 |
user output |
---|
10940 |
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
50000000000000 |
user output |
---|
(empty) |