#406055 (Rust) No.938 賢人を探せ

• 問題: No.938 賢人を探せ
• ユーザー: manta1130
• 提出日時: 2019-12-07 21:24:57
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 60 ms / 2,000 ms
• コード長: 3,450 bytes
• コンパイル時間: 19,203 ms
• コンパイル使用メモリ: 391,496 KB
• 実行使用メモリ: 10,688 KB
• 最終ジャッジ日時: 2024-05-08 09:03:47
• 合計ジャッジ時間: 14,451 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	59 ms; 10,688 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	17 ms; 7,592 KB
testcase_09	AC	17 ms; 7,568 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	19 ms; 8,080 KB
testcase_12	AC	20 ms; 7,352 KB
testcase_13	AC	19 ms; 7,120 KB
testcase_14	AC	19 ms; 7,220 KB
testcase_15	AC	19 ms; 7,104 KB
testcase_16	AC	19 ms; 7,116 KB
testcase_17	AC	19 ms; 7,344 KB
testcase_18	AC	18 ms; 7,228 KB
testcase_19	AC	19 ms; 7,096 KB
testcase_20	AC	20 ms; 7,096 KB
testcase_21	AC	19 ms; 7,228 KB
testcase_22	AC	60 ms; 10,680 KB

ソースコード

//  ____            _                  _                       _       _
// |  _ \ _   _ ___| |_    ___ _ __   | |_ ___ _ __ ___  _ __ | | __ _| |_ ___
// | |_) | | | / __| __|  / __| '_ \  | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \
// |  _ <| |_| \__ \ |_  | (__| |_) | | ||  __/ | | | | | |_) | | (_| | ||  __/
// |_| \_\\__,_|___/\__|  \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___|
//                            |_| |_____|               |_|

//https://github.com/manta1130/Competitive_Programming_Template_Rust

#[macro_use]
mod input {

    use std;
    use std::io;

    const SPLIT_DELIMITER: char = ' ';

    #[macro_export]
    #[allow(unused_macros)]
    macro_rules! input {
    ( $($x:expr ),*) => {
        {
            let temp_str = input_line_str();
            let mut split_result_iter = temp_str.split_whitespace();
                $(
                let buf_split_result = split_result_iter.next();
                let buf_split_result = buf_split_result.unwrap();
                    ($x) = buf_split_result.parse().unwrap();
                )*
        }
    };
}

    #[allow(dead_code)]
    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn p<T>(t: T)
    where
        T: std::fmt::Display,
    {
        println!("{}", t);
    }

    #[allow(dead_code)]
    pub fn input_vector2d<T>(line: usize) -> Vec<Vec<T>>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<Vec<T>> = Vec::new();

        for _ in 0..line {
            let vec_line = input_vector();
            v.push(vec_line);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    #[allow(dead_code)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error"),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}

use input::*;
use std::collections::{HashMap, HashSet};

fn main() {
    let n: usize;
    input!(n);
    let mut map = HashMap::new();
    let mut list = vec![];
    for _ in 0..n {
        let (a, b): (String, String);
        input!(a, b);
        map.entry(a.clone()).or_insert(Vec::new()).push(b.clone());
        map.entry(b.clone()).or_insert(Vec::new());
        list.push(b);
    }
    let mut ans = HashSet::new();
    for (i, x) in &map {
        //println!("{:?} -> {:?}", &i, &x);
        if x.is_empty() {
            ans.insert(i);
        }
    }

    for z in list {
        if ans.contains(&z) {
            p(&z);
            ans.remove(&z);
        }
    }
}