Submission #3416327


Source Code Expand

#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
mod util {
    use std::fmt::Debug;
    use std::io::{stdin, stdout, BufWriter, StdoutLock};
    use std::str::FromStr;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn chars() -> Vec<char> {
        line().chars().collect()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
    #[allow(dead_code)]
    pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
        let out = stdout();
        let writer = BufWriter::new(out.lock());
        f(writer)
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( [ $ t : ty ] ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( [ $ t : ty ] ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( [ $ t ] ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}
fn solve() {
    let (a, b) = get!(i64, i64);

    let mut ans = -100000000;
    for i in 0..6 {
        for j in 0..10 {
            if (i == 2 && j == 0) || (i == 5 && j == 0) {
                continue;
            }
            let a = if i < 3 {
                let base = 10i64.pow(i as u32);
                a - ((a / base) % 10) * base + j * base
            } else {
                a
            };

            let b = if i >= 3 {
                let base = 10i64.pow((i - 3) as u32);
                b - ((b / base) % 10) * base + j * base
            } else {
                b
            };

            ans = max(ans, a - b);
        }
    }
    println!("{}", ans);
}

Submission Info

Submission Time
Task A - A - B problem
User hatoo
Language Rust (1.15.1)
Score 100
Code Size 3612 Byte
Status AC
Exec Time 3 ms
Memory 8572 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 3 ms 8572 KB
ansneg_1.txt AC 3 ms 8572 KB
ansneg_2.txt AC 3 ms 8572 KB
ansneg_3.txt AC 3 ms 8572 KB
ansneg_4.txt AC 3 ms 8572 KB
ansneg_5.txt AC 3 ms 8572 KB
ansneg_6.txt AC 3 ms 8572 KB
ansneg_7.txt AC 3 ms 8572 KB
ansneg_8.txt AC 3 ms 8572 KB
ansneg_9.txt AC 3 ms 8572 KB
handmade_0.txt AC 3 ms 8572 KB
handmade_1.txt AC 3 ms 8572 KB
random_0.txt AC 3 ms 8572 KB
random_1.txt AC 3 ms 8572 KB
random_2.txt AC 3 ms 8572 KB
random_3.txt AC 3 ms 8572 KB
random_4.txt AC 3 ms 8572 KB
random_5.txt AC 3 ms 8572 KB
random_6.txt AC 3 ms 8572 KB
random_7.txt AC 3 ms 8572 KB
random_8.txt AC 3 ms 8572 KB
random_9.txt AC 3 ms 8572 KB
sample_0.txt AC 3 ms 8572 KB
sample_1.txt AC 3 ms 8572 KB
sample_2.txt AC 3 ms 8572 KB
top2fixed_0.txt AC 3 ms 8572 KB
top2fixed_1.txt AC 3 ms 8572 KB
top2fixed_2.txt AC 3 ms 8572 KB
top2fixed_3.txt AC 3 ms 8572 KB
top2fixed_4.txt AC 3 ms 8572 KB
top2fixed_5.txt AC 3 ms 8572 KB
top2fixed_6.txt AC 3 ms 8572 KB
top2fixed_7.txt AC 3 ms 8572 KB
top2fixed_8.txt AC 3 ms 8572 KB
top2fixed_9.txt AC 3 ms 8572 KB
topfixed_0.txt AC 3 ms 8572 KB
topfixed_1.txt AC 3 ms 8572 KB
topfixed_2.txt AC 3 ms 8572 KB
topfixed_3.txt AC 3 ms 8572 KB
topfixed_4.txt AC 3 ms 8572 KB
topfixed_5.txt AC 3 ms 8572 KB
topfixed_6.txt AC 3 ms 8572 KB
topfixed_7.txt AC 3 ms 8572 KB
topfixed_8.txt AC 3 ms 8572 KB
topfixed_9.txt AC 3 ms 8572 KB