結果

問題 No.1795 AtCoder Heuristic Rating coloring
ユーザー kenichikenichi
提出日時 2023-08-24 17:49:40
言語 Rust
(1.77.0)
結果
AC  
実行時間 249 ms / 2,000 ms
コード長 6,897 bytes
コンパイル時間 1,596 ms
コンパイル使用メモリ 157,004 KB
実行使用メモリ 22,832 KB
最終ジャッジ日時 2023-08-24 17:49:52
合計ジャッジ時間 10,947 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 5 ms
4,376 KB
testcase_05 AC 5 ms
4,380 KB
testcase_06 AC 6 ms
4,380 KB
testcase_07 AC 6 ms
4,376 KB
testcase_08 AC 6 ms
4,376 KB
testcase_09 AC 7 ms
4,376 KB
testcase_10 AC 6 ms
4,380 KB
testcase_11 AC 6 ms
4,376 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 1 ms
4,380 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 1 ms
4,376 KB
testcase_19 AC 1 ms
4,376 KB
testcase_20 AC 1 ms
4,376 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 1 ms
4,380 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 1 ms
4,380 KB
testcase_25 AC 1 ms
4,376 KB
testcase_26 AC 1 ms
4,380 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 1 ms
4,380 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 1 ms
4,376 KB
testcase_32 AC 85 ms
10,664 KB
testcase_33 AC 67 ms
8,424 KB
testcase_34 AC 119 ms
14,008 KB
testcase_35 AC 104 ms
12,188 KB
testcase_36 AC 124 ms
13,976 KB
testcase_37 AC 74 ms
9,652 KB
testcase_38 AC 74 ms
9,328 KB
testcase_39 AC 130 ms
14,776 KB
testcase_40 AC 92 ms
11,064 KB
testcase_41 AC 120 ms
14,060 KB
testcase_42 AC 84 ms
10,380 KB
testcase_43 AC 105 ms
10,636 KB
testcase_44 AC 117 ms
11,992 KB
testcase_45 AC 84 ms
10,416 KB
testcase_46 AC 145 ms
17,432 KB
testcase_47 AC 40 ms
5,928 KB
testcase_48 AC 90 ms
10,388 KB
testcase_49 AC 150 ms
17,724 KB
testcase_50 AC 80 ms
10,152 KB
testcase_51 AC 72 ms
9,500 KB
testcase_52 AC 169 ms
20,468 KB
testcase_53 AC 158 ms
20,472 KB
testcase_54 AC 223 ms
22,612 KB
testcase_55 AC 227 ms
22,652 KB
testcase_56 AC 249 ms
22,832 KB
testcase_57 AC 222 ms
22,608 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//use std::io::*;
//use std::str::FromStr;
use std::collections::HashMap;
/*
const LOW_CASE_ALPHABET: [char; 26] = [
    'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
    't', 'u', 'v', 'w', 'x', 'y', 'z',
];
*/

fn main() {
    let mut buf = String::new();
    let mut input = {
        use std::io::Read;
        std::io::stdin().read_to_string(&mut buf).unwrap();
        buf.split_whitespace()
    };

    let n: usize = input.next().unwrap().parse().unwrap();
    let m: usize = input.next().unwrap().parse().unwrap();

    let mut s = vec![];
    let mut a = vec![];
    for _ in 0..n {
        let s_i: String = input.next().unwrap().parse().unwrap();
        let a_i: usize = input.next().unwrap().parse().unwrap();
        s.push(s_i);
        a.push(a_i);
    }

    let mut t = vec![];
    let mut b = vec![];
    for _ in 0..m {
        let t_j: String = input.next().unwrap().parse().unwrap();
        let b_j: usize = input.next().unwrap().parse().unwrap();
        t.push(t_j);
        b.push(b_j);
    }

    let mut rate_map = HashMap::new();
    for i in 0..n {
        rate_map.insert(s[i].clone(), a[i]);
    }
    for j in 0..m{
        rate_map.insert(t[j].clone(), b[j]);
    }

    let mut rate_vec = rate_map.into_iter().collect::<Vec<_>>();
    rate_vec.sort_by(|(key1, _), (key2, _)| key1.cmp(&key2));

    for (name, rate) in &rate_vec {
        println!("{} {}",name, rate);
    }
}
/*
pub fn perfect(value_1: usize) -> usize {
    let mut perfect_number = Vec::new();
    for _i in 2..=value_1 {
        let mut tmp = 0;
        for _j in 1..=((_i as f64).powf(0.5)) as usize {
            if _i % _j == 0 {
                if _j * _j == _i {
                    tmp += _j;
                } else {
                    tmp += _j + (_i / _j);
                }
            }
        }
        tmp -= _i;

        if tmp == _i {
            perfect_number.push(_i);
        }
    }

    for _i in 0..perfect_number.len() - 1 {
        println!("{}", perfect_number[_i]);
    }
    return perfect_number[perfect_number.len() - 1];
}

pub fn prime_number(value_1: usize, value_2: usize) -> usize {
    let mut primary = Vec::new();
    primary.push(2);

    for _i in 2..=value_1 {
        let mut flag = 0;
        for _j in 0..primary.len() {
            if _i % primary[_j] == 0 {
                flag = 1;
                break;
            }
        }
        if flag == 0 {
            primary.push(_i);
        }
        if primary.len() == value_2 {
            return primary[primary.len() - 1];
        }
    }

    return 0;
}

pub fn ctoi(c: char) -> isize {
    let n = c as isize - '0' as isize;

    return n;
}

pub fn stoi(c: String) -> isize {
    let n = c.parse::<isize>().unwrap();

    return n;
}

pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize {
    for _i in start as usize..sentence.len() {
        if sentence[_i] == target {
            return _i as isize;
        }
    }
    return -1;
}

pub fn hex_to_binary_2(hex_string: String, x: u32) -> Option<String> {
    match i64::from_str_radix(&hex_string, x) {
        Ok(decimal) => Some(format!("{}", decimal)),
        Err(_) => None,
    }
}

pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> {
    match i64::from_str_radix(hex_string, x) {
        Ok(decimal) => Some(format!("{}", decimal)),
        Err(_) => None,
    }
}

pub fn my_floor(x: f64) -> f64 {
    let rounded = (x * 1000.0).floor() / 1000.0;

    rounded
}

pub fn upper_lower(x: char) -> char {
    let result: char;

    if x.is_uppercase() {
        result = x.to_ascii_lowercase();
    } else if x.is_lowercase() {
        result = x.to_ascii_uppercase();
    } else {
        result = x;
    }

    result
}

pub fn maxf_2(x: f64, y: f64) -> f64 {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn max_u_2(x: usize, y: usize) -> usize {
    let result;

    if x >= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_u_2(x: usize, y: usize) -> usize {
    let result;

    if x <= y {
        result = x;
    } else {
        result = y;
    }

    result
}

pub fn min_2(x: isize, y: isize) -> isize {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn min_2_i32(x: i32, y: i32) -> i32 {
    let result;

    if x >= y {
        result = y;
    } else {
        result = x;
    }

    result
}

pub fn max_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x >= y && y >= z {
        result = x;
    } else if x >= z && z >= y {
        result = x;
    } else if y >= x && x >= z {
        result = y;
    } else if y >= z && z >= x {
        result = y;
    } else if z >= x && x >= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_3(x: isize, y: isize, z: isize) -> isize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {
    let result;
    if x <= y && y <= z {
        result = x;
    } else if x <= z && z <= y {
        result = x;
    } else if y <= x && x <= z {
        result = y;
    } else if y <= z && z <= x {
        result = y;
    } else if z <= x && x <= y {
        result = z;
    } else {
        result = z;
    }

    result
}

pub fn read_text() -> String {
    let mut word = String::new();
    std::io::stdin().read_line(&mut word).ok();
    let answer = word.trim().to_string();

    answer
}

pub fn read_array() -> Vec<char> {
    let array: String = read();
    let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>();
    chars
}

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}
*/
0