Tulostaulu

use std::{collections::HashMap, io::{stdin, Stdin}};

fn read_line(stdin: &mut Stdin) -> String {
    let mut s = String::new();
    stdin.read_line(&mut s).unwrap();
    s = s.trim().to_owned();
    return s
}

fn main() {
    let mut stdin = stdin();
    let (contestant_count, attempt_count, task_count) = {
        let line = read_line(&mut stdin);
        let mut iter = line.split_whitespace().map(|x| x.parse::<u32>().unwrap());
        (iter.next().unwrap(), iter.next().unwrap(), iter.next().unwrap())
    };

    let mut player_data = HashMap::new();
    for _ in 0..contestant_count {
        let line = read_line(&mut stdin);
        player_data.insert(line, vec![(0_u32, 0_u32); task_count as usize]);
    }

    for i in 0..attempt_count {
        let line = read_line(&mut stdin);
        let mut iter = line.split_whitespace();

        let contestant = iter.next().unwrap();
        let task = get_task_index(iter.next().unwrap());
        let points: u32 = iter.next().unwrap().parse().unwrap();

        let data = player_data.get_mut(contestant).unwrap().get_mut(task).unwrap();
        if data.0 < points {
            data.0 = points;
            data.1 = i;
        }
    }

    let mut scoreboard: Vec<(&String, (u32, u32))> = player_data.iter().map(|(name, taskdata)| (name, (taskdata.iter().map(|x| x.0).sum(), taskdata.iter().map(|x| x.1).max().unwrap()))).collect();
    scoreboard.sort_by(|a, b| b.1.0.cmp(&a.1.0).then(a.1.1.cmp(&b.1.1)).then(a.0.cmp(&b.0)));
    let scoreboard: Vec<String> = scoreboard.iter().map(|x| format!("{} {}", x.0, x.1.0)).collect();
    println!("{}", scoreboard.join("\n"));
}

fn get_task_index(name: &str) -> usize {
    name.chars().next().unwrap().to_ascii_uppercase() as usize - 65
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED