use std::collections::HashMap; fn get_line() -> Vec { let stdin = std::io::stdin(); let mut s = String::new(); loop { stdin.read_line(&mut s).ok(); let s = s.trim(); if s.len() != 0 { // println!("show: {}", s); return s.split_whitespace().map(|s| s.into()).collect(); } } } #[derive(PartialEq, PartialOrd, Eq, Ord)] struct Competitor { // 上から順に比較される sum_score: i32, update_time: i32, name: String, score: Vec, } impl Competitor { fn new(name: &str, n: usize) -> Competitor { Competitor { name: name.into(), score: vec![0; n], // score: Vec::with_capacity(n), sum_score: 0, update_time: 0, } } } fn main() { let n: usize = get_line()[0].parse().unwrap(); let levels: Vec = get_line().iter().map(|l| l.parse().unwrap()).collect(); assert_eq!(n, levels.len()); let t: i32 = get_line()[0].parse().unwrap(); let mut accepted: Vec = vec![0.0; n]; // let mut accepted: [i32; n]; let mut competitors = HashMap::new(); for times in 0..t { let words = get_line(); let name = words[0].to_string(); let p = (words[1].chars().nth(0).unwrap() as usize) - ('A' as usize); if !competitors.contains_key(&name) { competitors.insert(name.to_string(), Competitor::new(&name, n)); } accepted[p] += 1.0; let lv = levels[p]; let solve_score = (50.0 * lv + 50.0 * lv / (0.8 + 0.2 * accepted[p])).floor() as i32; let mut competitor = competitors.get_mut(&name).unwrap(); competitor.score[p] = solve_score; competitor.sum_score += solve_score; competitor.update_time = -times; // 逆順にソートしてほしいので } let mut competitors_vec: Vec<_> = competitors.values().collect(); competitors_vec.sort(); competitors_vec.reverse(); for i in 0..competitors_vec.len() { let c = competitors_vec[i]; print!("{} {}", i+1, c.name); for i in 0..n { print!(" {}", c.score[i]); } println!(" {}", c.sum_score); } }