Submission #8204911


Source Code Expand

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

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

//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;

fn main() {
    let s = input_line_str();
    let mut it = s.split("/");
    let y = it.next().unwrap();
    let m = it.next().unwrap();
    let d = it.next().unwrap();
    let mut m1 = HashMap::new();
    let mut m2 = HashMap::new();
    for c in y.chars() {
        *m1.entry(c).or_insert(0) += 1;
    }
    for c in m.chars() {
        *m2.entry(c).or_insert(0) += 1;
    }
    for c in d.chars() {
        *m2.entry(c).or_insert(0) += 1;
    }
    if m1 == m2 {
        p("yes");
    } else {
        p("no");
    }
}

Submission Info

Submission Time
Task A - 2012年12月02日
User manta1130
Language Rust (1.15.1)
Score 100
Code Size 3881 Byte
Status AC
Exec Time 2 ms
Memory 4352 KB

Compile Error

warning: unknown lint: `unused_macros`, #[warn(unknown_lints)] on by default
  --> ./Main.rs:25:13
   |
25 |     #[allow(unused_macros)]
   |             ^^^^^^^^^^^^^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 93
Set Name Test Cases
All 010_00.txt, 010_01.txt, 010_02.txt, 010_03.txt, 010_04.txt, 010_05.txt, 010_06.txt, 010_07.txt, 010_08.txt, 010_09.txt, 010_10.txt, 010_11.txt, 010_12.txt, 010_13.txt, 010_14.txt, 010_15.txt, 010_16.txt, 010_17.txt, 010_18.txt, 010_19.txt, 010_20.txt, 010_21.txt, 010_22.txt, 010_23.txt, 010_24.txt, 010_25.txt, 010_26.txt, 010_27.txt, 010_28.txt, 010_29.txt, 020_00.txt, 020_01.txt, 020_02.txt, 020_03.txt, 020_04.txt, 020_05.txt, 020_06.txt, 020_07.txt, 020_08.txt, 020_09.txt, 020_10.txt, 020_11.txt, 020_12.txt, 020_13.txt, 020_14.txt, 020_15.txt, 020_16.txt, 020_17.txt, 020_18.txt, 020_19.txt, 020_20.txt, 020_21.txt, 020_22.txt, 020_23.txt, 020_24.txt, 020_25.txt, 020_26.txt, 020_27.txt, 020_28.txt, 020_29.txt, 030_00.txt, 030_01.txt, 030_02.txt, 030_03.txt, 030_04.txt, 030_05.txt, 030_06.txt, 030_07.txt, 030_08.txt, 030_09.txt, 030_10.txt, 030_11.txt, 030_12.txt, 030_13.txt, 030_14.txt, 030_15.txt, 030_16.txt, 030_17.txt, 030_18.txt, 030_19.txt, 030_20.txt, 030_21.txt, 030_22.txt, 030_23.txt, 030_24.txt, 030_25.txt, 030_26.txt, 030_27.txt, 030_28.txt, 030_29.txt, sample.txt, teuti_01.txt, teuti_02.txt
Case Name Status Exec Time Memory
010_00.txt AC 2 ms 4352 KB
010_01.txt AC 2 ms 4352 KB
010_02.txt AC 2 ms 4352 KB
010_03.txt AC 2 ms 4352 KB
010_04.txt AC 2 ms 4352 KB
010_05.txt AC 2 ms 4352 KB
010_06.txt AC 2 ms 4352 KB
010_07.txt AC 2 ms 4352 KB
010_08.txt AC 2 ms 4352 KB
010_09.txt AC 2 ms 4352 KB
010_10.txt AC 2 ms 4352 KB
010_11.txt AC 2 ms 4352 KB
010_12.txt AC 2 ms 4352 KB
010_13.txt AC 2 ms 4352 KB
010_14.txt AC 2 ms 4352 KB
010_15.txt AC 2 ms 4352 KB
010_16.txt AC 2 ms 4352 KB
010_17.txt AC 2 ms 4352 KB
010_18.txt AC 2 ms 4352 KB
010_19.txt AC 2 ms 4352 KB
010_20.txt AC 2 ms 4352 KB
010_21.txt AC 2 ms 4352 KB
010_22.txt AC 2 ms 4352 KB
010_23.txt AC 2 ms 4352 KB
010_24.txt AC 2 ms 4352 KB
010_25.txt AC 2 ms 4352 KB
010_26.txt AC 2 ms 4352 KB
010_27.txt AC 2 ms 4352 KB
010_28.txt AC 2 ms 4352 KB
010_29.txt AC 2 ms 4352 KB
020_00.txt AC 2 ms 4352 KB
020_01.txt AC 2 ms 4352 KB
020_02.txt AC 2 ms 4352 KB
020_03.txt AC 2 ms 4352 KB
020_04.txt AC 2 ms 4352 KB
020_05.txt AC 2 ms 4352 KB
020_06.txt AC 2 ms 4352 KB
020_07.txt AC 2 ms 4352 KB
020_08.txt AC 2 ms 4352 KB
020_09.txt AC 2 ms 4352 KB
020_10.txt AC 2 ms 4352 KB
020_11.txt AC 2 ms 4352 KB
020_12.txt AC 2 ms 4352 KB
020_13.txt AC 2 ms 4352 KB
020_14.txt AC 2 ms 4352 KB
020_15.txt AC 2 ms 4352 KB
020_16.txt AC 2 ms 4352 KB
020_17.txt AC 2 ms 4352 KB
020_18.txt AC 2 ms 4352 KB
020_19.txt AC 2 ms 4352 KB
020_20.txt AC 2 ms 4352 KB
020_21.txt AC 2 ms 4352 KB
020_22.txt AC 2 ms 4352 KB
020_23.txt AC 2 ms 4352 KB
020_24.txt AC 2 ms 4352 KB
020_25.txt AC 2 ms 4352 KB
020_26.txt AC 2 ms 4352 KB
020_27.txt AC 2 ms 4352 KB
020_28.txt AC 2 ms 4352 KB
020_29.txt AC 2 ms 4352 KB
030_00.txt AC 2 ms 4352 KB
030_01.txt AC 2 ms 4352 KB
030_02.txt AC 2 ms 4352 KB
030_03.txt AC 2 ms 4352 KB
030_04.txt AC 2 ms 4352 KB
030_05.txt AC 2 ms 4352 KB
030_06.txt AC 2 ms 4352 KB
030_07.txt AC 2 ms 4352 KB
030_08.txt AC 2 ms 4352 KB
030_09.txt AC 2 ms 4352 KB
030_10.txt AC 2 ms 4352 KB
030_11.txt AC 2 ms 4352 KB
030_12.txt AC 2 ms 4352 KB
030_13.txt AC 2 ms 4352 KB
030_14.txt AC 2 ms 4352 KB
030_15.txt AC 2 ms 4352 KB
030_16.txt AC 2 ms 4352 KB
030_17.txt AC 2 ms 4352 KB
030_18.txt AC 2 ms 4352 KB
030_19.txt AC 2 ms 4352 KB
030_20.txt AC 2 ms 4352 KB
030_21.txt AC 2 ms 4352 KB
030_22.txt AC 2 ms 4352 KB
030_23.txt AC 2 ms 4352 KB
030_24.txt AC 2 ms 4352 KB
030_25.txt AC 2 ms 4352 KB
030_26.txt AC 2 ms 4352 KB
030_27.txt AC 2 ms 4352 KB
030_28.txt AC 2 ms 4352 KB
030_29.txt AC 2 ms 4352 KB
sample.txt AC 2 ms 4352 KB
teuti_01.txt AC 2 ms 4352 KB
teuti_02.txt AC 2 ms 4352 KB