Submission #5298170


Source Code Expand

// Original: https://github.com/tanakh/competitive-rs
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::collections::{HashMap};

fn main() {
    input!(a:i64,b:i64);

    let f = |x| [x/ 100, x%100/10, x%10];
    let g = |a,b,c| a*100 + b*10+c;

    let aa = f(a);
    let bb = f(b);
    let mut vs = vec![
        g(9,aa[1],aa[2]) - b,
        g(aa[0],9,aa[2]) -b,
        g(aa[0],aa[1],9) - b,
        a - g(1,bb[1],bb[2]),
        a - g(bb[0],0,bb[2]),
        a - g(bb[0],bb[1],0)
    ];
    vs.sort();
    println!("{}", vs.last().unwrap());
}

Submission Info

Submission Time
Task A - A - B problem
User guricerin
Language Rust (1.15.1)
Score 100
Code Size 2305 Byte
Status AC
Exec Time 2 ms
Memory 4352 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 45
Set Name Test Cases
Sample sample_0.txt, sample_1.txt, sample_2.txt
All ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt
Case Name Status Exec Time Memory
ansneg_0.txt AC 2 ms 4352 KB
ansneg_1.txt AC 2 ms 4352 KB
ansneg_2.txt AC 2 ms 4352 KB
ansneg_3.txt AC 2 ms 4352 KB
ansneg_4.txt AC 2 ms 4352 KB
ansneg_5.txt AC 2 ms 4352 KB
ansneg_6.txt AC 2 ms 4352 KB
ansneg_7.txt AC 2 ms 4352 KB
ansneg_8.txt AC 2 ms 4352 KB
ansneg_9.txt AC 2 ms 4352 KB
handmade_0.txt AC 2 ms 4352 KB
handmade_1.txt AC 2 ms 4352 KB
random_0.txt AC 2 ms 4352 KB
random_1.txt AC 2 ms 4352 KB
random_2.txt AC 2 ms 4352 KB
random_3.txt AC 2 ms 4352 KB
random_4.txt AC 2 ms 4352 KB
random_5.txt AC 2 ms 4352 KB
random_6.txt AC 2 ms 4352 KB
random_7.txt AC 2 ms 4352 KB
random_8.txt AC 2 ms 4352 KB
random_9.txt AC 2 ms 4352 KB
sample_0.txt AC 2 ms 4352 KB
sample_1.txt AC 2 ms 4352 KB
sample_2.txt AC 2 ms 4352 KB
top2fixed_0.txt AC 2 ms 4352 KB
top2fixed_1.txt AC 2 ms 4352 KB
top2fixed_2.txt AC 2 ms 4352 KB
top2fixed_3.txt AC 2 ms 4352 KB
top2fixed_4.txt AC 2 ms 4352 KB
top2fixed_5.txt AC 2 ms 4352 KB
top2fixed_6.txt AC 2 ms 4352 KB
top2fixed_7.txt AC 2 ms 4352 KB
top2fixed_8.txt AC 2 ms 4352 KB
top2fixed_9.txt AC 2 ms 4352 KB
topfixed_0.txt AC 2 ms 4352 KB
topfixed_1.txt AC 2 ms 4352 KB
topfixed_2.txt AC 2 ms 4352 KB
topfixed_3.txt AC 2 ms 4352 KB
topfixed_4.txt AC 2 ms 4352 KB
topfixed_5.txt AC 2 ms 4352 KB
topfixed_6.txt AC 2 ms 4352 KB
topfixed_7.txt AC 2 ms 4352 KB
topfixed_8.txt AC 2 ms 4352 KB
topfixed_9.txt AC 2 ms 4352 KB