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

• 問題: No.1106 🦉 何事もバランスが大事
• ユーザー: koba-e964
• 提出日時: 2020-07-12 16:09:04
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 6,398 bytes
• コンパイル時間: 4,619 ms
• コンパイル使用メモリ: 168,684 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-23 13:13:41
• 合計ジャッジ時間: 4,057 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

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

ソースコード

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
// 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"));
}

// ref: https://kuretchi.github.io/blog/entries/automaton-dp/
/// An (almost) positional DFA. "Positional" means transition may change
/// depending on how many chars it has already consumed.
/// trans is allowed to return None.
/// S: alphabet (the set consisting of letters)
trait PosDFA<S> {
    /// size should remain constant whatever its position is.
    fn size(&self) -> usize;
    fn trans(&self, pos: usize, state: usize, char: S) -> Option<usize>;
    fn init(&self) -> Vec<usize>;
    fn is_final_state(&self, pos: usize, state: usize) -> bool;
}

struct Prod<A, B>(A, B);

impl<S: Copy, A: PosDFA<S>, B: PosDFA<S>> PosDFA<S> for Prod<A, B> {
    fn size(&self) -> usize {
        self.0.size() * self.1.size()
    }
    fn trans(&self, pos: usize, state: usize, char: S) -> Option<usize> {
        let w = self.1.size();
        let (x, y) = (state / w, state % w);
        if let Some(to1) = self.0.trans(pos, x, char) {
            if let Some(to2) = self.1.trans(pos, y, char) {
                return Some(to1 * w + to2);
            }
        }
        None
    }
    fn init(&self) -> Vec<usize> {
        let w = self.1.size();
        let b_init = self.1.init();
        let mut ans = vec![];
        for av in self.0.init() {
            for &bv in &b_init {
                ans.push(av * w + bv);
            }
        }
        ans
    }
    fn is_final_state(&self, pos: usize, state: usize) -> bool {
        let w = self.1.size();
        let (x, y) = (state / w, state % w);
        self.0.is_final_state(pos, x) && self.1.is_final_state(pos, y)
    }
}

trait ActionMonoid<S> {
    type T;
    fn add(&self, x: Self::T, y: Self::T) -> Self::T;
    fn act(&self, x: Self::T, letter: S) -> Self::T;
    fn zero(&self) -> Self::T;
    fn one(&self) -> Self::T;
}

struct Add;

impl<S> ActionMonoid<S> for Add {
    type T = i64;
    fn add(&self, x: i64, y: i64) -> i64 {
        x + y
    }
    fn act(&self, x: i64, _y: S) -> i64 {
        x
    }
    fn zero(&self) -> i64 { 0 }
    fn one(&self) -> i64 { 1 }
}

struct GtZero;

impl PosDFA<i32> for GtZero {
    fn size(&self) -> usize {
        2
    }
    fn trans(&self, _: usize, zero: usize, c: i32) -> Option<usize> {
        if zero == 1 && c < 0 {
            return None;
        }
        Some(zero & if c == 0 { 1 } else { 0 })
    }
    fn init(&self) -> Vec<usize> {
        vec![1]
    }
    fn is_final_state(&self, _: usize, state: usize) -> bool {
        state == 0
    }
}

struct DeltaZero(usize);

impl PosDFA<i32> for DeltaZero {
    fn size(&self) -> usize {
        2 * self.0
    }
    fn trans(&self, _: usize, delta: usize, c: i32) -> Option<usize> {
        let delta = delta as i32;
        if delta + c < 0 || delta + c >= 2 * self.0 as i32 {
            return None;
        }
        Some((delta + c) as usize)
    }
    fn init(&self) -> Vec<usize> {
        vec![self.0]
    }
    fn is_final_state(&self, _: usize, state: usize) -> bool {
        state == self.0
    }
}

struct Lt(Vec<i32>);

impl PosDFA<i32> for Lt {
    fn size(&self) -> usize {
        2
    }
    fn trans(&self, pos: usize, eq: usize, c: i32) -> Option<usize> {
        if eq == 1 && c > self.0[pos] {
            return None;
        }
        Some(eq & if c == self.0[pos] { 1 } else { 0 })
    }
    fn init(&self) -> Vec<usize> {
        vec![1]
    }
    fn is_final_state(&self, _pos: usize, _state: usize) -> bool {
        true
    }
}

fn posdfa_dp<S: Copy + Ord, A: PosDFA<S>, M: ActionMonoid<S>>(
    dfa: A, monoid: M,
    alpha: &[S], len: usize,
) -> M::T where M::T: Copy {
    let n = dfa.size();
    let init = dfa.init();
    let mut dp = vec![vec![monoid.zero(); n]; len + 1];
    for &v in &init {
        dp[0][v] = monoid.one();
    }
    for i in 0..len {
        for j in 0..n {
            let val = dp[i][j];
            for &c in alpha {
                if let Some(to) = dfa.trans(i, j, c) {
                    dp[i + 1][to]
                        = monoid.add(dp[i + 1][to],
                                     monoid.act(val, c));
                }
            }
        }
    }
    let mut ans = monoid.zero();
    for i in 0..n {
        if dfa.is_final_state(len, i) {
                ans = monoid.add(ans, dp[len][i]);
        }
    }
    ans
}

fn main() {
    input!(n: i64);
    const N: usize = 30;
    let alpha = [-2, -1, 0, 1, 2];
    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 as i32;
        v = (v - r) / 5;
    }
    let dfa = Prod(GtZero, DeltaZero(2 * N));
    let dfa = Prod(dfa, Lt(dig));
    let ans = posdfa_dp(dfa, Add, &alpha, N);
    println!("{}", ans);
}