#506365 (Rust) No.1106 🦉 何事もバランスが大事

• 問題: No.1106 🦉 何事もバランスが大事
• ユーザー: koba-e964
• 提出日時: 2020-07-03 22:32:24
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 3,684 bytes
• コンパイル時間: 13,097 ms
• コンパイル使用メモリ: 401,796 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-17 04:11:22
• 合計ジャッジ時間: 13,574 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	1 ms; 6,944 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	1 ms; 6,944 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	1 ms; 6,944 KB
testcase_13	AC	1 ms; 6,944 KB
testcase_14	AC	1 ms; 6,940 KB
testcase_15	AC	1 ms; 6,944 KB
testcase_16	AC	1 ms; 6,940 KB
testcase_17	AC	2 ms; 6,940 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	1 ms; 6,940 KB
testcase_21	AC	1 ms; 6,940 KB
testcase_22	AC	1 ms; 6,944 KB
testcase_23	AC	1 ms; 6,944 KB
testcase_24	AC	1 ms; 6,940 KB
testcase_25	AC	1 ms; 6,940 KB
testcase_26	AC	1 ms; 6,944 KB
testcase_27	AC	1 ms; 6,940 KB
testcase_28	AC	1 ms; 6,940 KB
testcase_29	AC	1 ms; 6,940 KB
testcase_30	AC	1 ms; 6,940 KB
testcase_31	AC	1 ms; 6,940 KB
testcase_32	AC	1 ms; 6,940 KB
testcase_33	AC	1 ms; 6,940 KB
testcase_34	AC	1 ms; 6,940 KB
testcase_35	AC	1 ms; 6,940 KB
testcase_36	AC	1 ms; 6,940 KB
testcase_37	AC	1 ms; 6,940 KB
testcase_38	AC	1 ms; 6,940 KB
testcase_39	AC	1 ms; 6,940 KB
testcase_40	AC	1 ms; 6,940 KB
testcase_41	AC	1 ms; 6,940 KB
testcase_42	AC	1 ms; 6,940 KB
testcase_43	AC	1 ms; 6,940 KB
testcase_44	AC	1 ms; 6,940 KB
testcase_45	AC	1 ms; 6,944 KB
testcase_46	AC	1 ms; 6,940 KB
testcase_47	AC	1 ms; 6,940 KB
testcase_48	AC	1 ms; 6,940 KB
testcase_49	AC	1 ms; 6,940 KB
testcase_50	AC	1 ms; 6,940 KB
testcase_51	AC	1 ms; 6,940 KB
testcase_52	AC	1 ms; 6,944 KB
testcase_53	AC	1 ms; 6,940 KB
testcase_54	AC	1 ms; 6,940 KB
testcase_55	AC	1 ms; 6,944 KB
testcase_56	AC	1 ms; 6,940 KB
testcase_57	AC	1 ms; 6,940 KB
testcase_58	AC	1 ms; 6,940 KB
testcase_59	AC	1 ms; 6,940 KB
testcase_60	AC	1 ms; 6,940 KB
testcase_61	AC	1 ms; 6,944 KB
testcase_62	AC	1 ms; 6,940 KB
testcase_63	AC	1 ms; 6,944 KB
testcase_64	AC	1 ms; 6,940 KB
testcase_65	AC	1 ms; 6,940 KB
testcase_66	AC	1 ms; 6,944 KB
testcase_67	AC	1 ms; 6,944 KB
testcase_68	AC	1 ms; 6,944 KB
testcase_69	AC	1 ms; 6,940 KB
testcase_70	AC	1 ms; 6,940 KB
testcase_71	AC	1 ms; 6,940 KB
testcase_72	AC	1 ms; 6,940 KB
testcase_73	AC	1 ms; 6,944 KB
testcase_74	AC	1 ms; 6,940 KB
testcase_75	AC	1 ms; 6,944 KB
testcase_76	AC	1 ms; 6,944 KB
testcase_77	AC	1 ms; 6,944 KB
testcase_78	AC	1 ms; 6,944 KB
testcase_79	AC	1 ms; 6,944 KB
testcase_80	AC	1 ms; 6,940 KB
testcase_81	AC	1 ms; 6,944 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($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)*}
    };
}

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)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input!(n: i64);
    const N: usize = 30;
    // dp[pos][delta][eq][zero]
    let mut dp = vec![vec![[[0i64; 2]; 2]; 4 * N]; N + 1];
    dp[0][2 * N][1][1] += 1;
    let mut dig = vec![0; N];
    let mut v = n;
    for i in 0..N {
        let mut r = v % 5;
        if r >= 3 { r -= 5; }
        dig[N - 1 - i] = r;
        v = (v - r) / 5;
    }
    for i in 0..N {
        for j in 0..4 * N {
            for eq in 0..2 {
                for zero in 0..2 {
                    let val = dp[i][j][eq][zero];
                    if val == 0 { continue; }
                    for delta in -2..3 {
                        if delta < 0 && zero == 1 {
                            continue;
                        }
                        if eq == 1 && delta > dig[i] {
                            continue;
                        }
                        let to = j.wrapping_add(delta as usize);
                        if to >= 4 * N { continue; }
                        dp[i + 1][to][eq & if delta == dig[i] { 1 } else { 0 }]
                            [zero & if delta == 0 { 1 } else { 0 }] += val;
                    }
                }
            }
        }
    }
    let mut tot: i64 = 0;
    for eq in 0..2 {
        tot += dp[N][2 * N][eq][0];
    }
    puts!("{}\n", tot);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}