結果

問題 No.315 世界のなんとか3.5
ユーザー koba-e964koba-e964
提出日時 2021-10-09 00:36:43
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 130 ms / 2,000 ms
コード長 6,118 bytes
コンパイル時間 12,091 ms
コンパイル使用メモリ 402,124 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-23 09:18:29
合計ジャッジ時間 15,298 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,812 KB
testcase_02 AC 1 ms
6,816 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 33 ms
6,940 KB
testcase_13 AC 32 ms
6,944 KB
testcase_14 AC 63 ms
6,944 KB
testcase_15 AC 63 ms
6,944 KB
testcase_16 AC 64 ms
6,940 KB
testcase_17 AC 63 ms
6,940 KB
testcase_18 AC 33 ms
6,944 KB
testcase_19 AC 33 ms
6,940 KB
testcase_20 AC 33 ms
6,940 KB
testcase_21 AC 34 ms
6,940 KB
testcase_22 AC 64 ms
6,940 KB
testcase_23 AC 64 ms
6,940 KB
testcase_24 AC 64 ms
6,940 KB
testcase_25 AC 64 ms
6,940 KB
testcase_26 AC 64 ms
6,944 KB
testcase_27 AC 63 ms
6,940 KB
testcase_28 AC 60 ms
6,940 KB
testcase_29 AC 119 ms
6,940 KB
testcase_30 AC 117 ms
6,944 KB
testcase_31 AC 119 ms
6,940 KB
testcase_32 AC 127 ms
6,944 KB
testcase_33 AC 64 ms
6,944 KB
testcase_34 AC 111 ms
6,940 KB
testcase_35 AC 130 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
mod mod_int {
    use std::ops::*;
    pub trait Mod: Copy { fn m() -> i64; }
    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
    impl<M: Mod> ModInt<M> {
        // x >= 0
        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
        fn new_internal(x: i64) -> Self {
            ModInt { x: x, phantom: ::std::marker::PhantomData }
        }
        pub fn pow(self, mut e: i64) -> Self {
            debug_assert!(e >= 0);
            let mut sum = ModInt::new_internal(1);
            let mut cur = self;
            while e > 0 {
                if e % 2 != 0 { sum *= cur; }
                cur *= cur;
                e /= 2;
            }
            sum
        }
        #[allow(dead_code)]
        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x + other.x;
            if sum >= M::m() { sum -= M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x - other.x;
            if sum < 0 { sum += M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
        fn add_assign(&mut self, other: T) { *self = *self + other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
        fn sub_assign(&mut self, other: T) { *self = *self - other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
        fn mul_assign(&mut self, other: T) { *self = *self * other; }
    }
    impl<M: Mod> Neg for ModInt<M> {
        type Output = Self;
        fn neg(self) -> Self { ModInt::new(0) - self }
    }
    impl<M> ::std::fmt::Display for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_rules! define_mod {
    ($struct_name: ident, $modulo: expr) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
        struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 1_000_000_007;
define_mod!(P, MOD);
type MInt = mod_int::ModInt<P>;

fn calc(a: &[char], p: usize) -> [MInt; 2] {
    let n = a.len();
    let mut dp = vec![[[MInt::new(0); 2]; 2]; 3 * p];
    dp[0][0][1] = 1.into();
    for i in 0..n {
        let fromlen = if n - i < 5 { 3 * p } else { 3 };
        let tolen = if n - i <= 5 { 3 * p } else { 3 };
        let mut ep = vec![[[MInt::new(0); 2]; 2]; tolen];
        let c = (a[i] as u8 - b'0') as usize;
        for j in 0..fromlen {
            for u in 0..2 {
                for k in 0..2 {
                    let val = dp[j][u][k];
                    if val.x == 0 { continue; }
                    for l in 0..if k == 1 { c + 1 } else { 10 } {
                        let nj = (j * 10 + l) % tolen;
                        let nu = u | if l == 3 { 1 } else { 0 };
                        let nk = k & if l == c { 1 } else { 0 };
                        ep[nj][nu][nk] += val;
                    }
                }
            }
        }
        dp = ep;
    }
    let mut ans = [MInt::new(0); 2];
    for i in 0..3 * p {
        if i % p == 0 { continue; }
        for j in 0..2 {
            if i % 3 != 0 && j == 0 {
                continue;
            }
            for k in 0..2 {
                ans[k] += dp[i][j][k];
            }
        }
    }
    ans
}

fn main() {
    input!(a: chars, b: chars, p: usize);
    let v0 = calc(&a, p);
    let v1 = calc(&b, p);
    println!("{}", v1[0] + v1[1] - v0[0]);
}
0