#939770 (Rust) No.2592 おでぶなおばけさん 2

• 問題: No.2592 おでぶなおばけさん 2
• ユーザー: koba-e964
• 提出日時: 2023-12-22 10:40:31
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 70 ms / 2,500 ms
• コード長: 6,942 bytes
• コンパイル時間: 1,771 ms
• コンパイル使用メモリ: 199,996 KB
• 実行使用メモリ: 7,424 KB
• 最終ジャッジ日時: 2023-12-22 10:40:46
• 合計ジャッジ時間: 14,735 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	13 ms; 6,676 KB
testcase_02	AC	20 ms; 6,676 KB
testcase_03	AC	8 ms; 6,676 KB
testcase_04	AC	10 ms; 6,676 KB
testcase_05	AC	32 ms; 6,676 KB
testcase_06	AC	23 ms; 6,676 KB
testcase_07	AC	28 ms; 6,676 KB
testcase_08	AC	26 ms; 6,676 KB
testcase_09	AC	9 ms; 6,676 KB
testcase_10	AC	13 ms; 6,676 KB
testcase_11	AC	26 ms; 6,676 KB
testcase_12	AC	6 ms; 6,676 KB
testcase_13	AC	53 ms; 6,676 KB
testcase_14	AC	53 ms; 6,676 KB
testcase_15	AC	44 ms; 6,676 KB
testcase_16	AC	53 ms; 6,676 KB
testcase_17	AC	57 ms; 6,676 KB
testcase_18	AC	44 ms; 6,676 KB
testcase_19	AC	38 ms; 6,676 KB
testcase_20	AC	33 ms; 6,676 KB
testcase_21	AC	29 ms; 6,676 KB
testcase_22	AC	36 ms; 6,676 KB
testcase_23	AC	58 ms; 6,676 KB
testcase_24	AC	49 ms; 6,676 KB
testcase_25	AC	35 ms; 6,676 KB
testcase_26	AC	35 ms; 6,676 KB
testcase_27	AC	67 ms; 7,424 KB
testcase_28	AC	67 ms; 7,424 KB
testcase_29	AC	69 ms; 7,424 KB
testcase_30	AC	69 ms; 7,424 KB
testcase_31	AC	70 ms; 7,424 KB
testcase_32	AC	69 ms; 7,424 KB
testcase_33	AC	69 ms; 7,424 KB
testcase_34	AC	68 ms; 7,424 KB
testcase_35	AC	68 ms; 7,424 KB
testcase_36	AC	68 ms; 7,424 KB
testcase_37	AC	68 ms; 7,424 KB
testcase_38	AC	68 ms; 7,424 KB
testcase_39	AC	70 ms; 7,424 KB
testcase_40	AC	68 ms; 7,424 KB
testcase_41	AC	67 ms; 7,424 KB
testcase_42	AC	69 ms; 7,424 KB
testcase_43	AC	69 ms; 7,424 KB
testcase_44	AC	69 ms; 7,424 KB
testcase_45	AC	68 ms; 7,424 KB
testcase_46	AC	69 ms; 7,424 KB
testcase_47	AC	53 ms; 7,424 KB
testcase_48	AC	53 ms; 7,424 KB
testcase_49	AC	53 ms; 7,424 KB
testcase_50	AC	56 ms; 7,424 KB
testcase_51	AC	53 ms; 7,424 KB
testcase_52	AC	69 ms; 7,424 KB
testcase_53	AC	68 ms; 7,424 KB
testcase_54	AC	67 ms; 7,424 KB
testcase_55	AC	68 ms; 7,424 KB
testcase_56	AC	68 ms; 7,424 KB
testcase_57	AC	25 ms; 6,676 KB
testcase_58	AC	68 ms; 7,424 KB
testcase_59	AC	67 ms; 7,424 KB
testcase_60	AC	68 ms; 7,424 KB
testcase_61	AC	67 ms; 7,424 KB
testcase_62	AC	68 ms; 7,424 KB
testcase_63	AC	68 ms; 7,424 KB
testcase_64	AC	68 ms; 7,424 KB
testcase_65	AC	64 ms; 7,424 KB
testcase_66	AC	64 ms; 7,424 KB
testcase_67	AC	63 ms; 7,424 KB
testcase_68	AC	63 ms; 7,424 KB
testcase_69	AC	63 ms; 7,424 KB
testcase_70	AC	63 ms; 7,424 KB
testcase_71	AC	64 ms; 7,424 KB
testcase_72	AC	64 ms; 7,424 KB
testcase_73	AC	64 ms; 7,424 KB
testcase_74	AC	1 ms; 6,676 KB
testcase_75	AC	69 ms; 7,424 KB
testcase_76	AC	69 ms; 7,424 KB
testcase_77	AC	68 ms; 7,424 KB
testcase_78	AC	69 ms; 7,424 KB
testcase_79	AC	68 ms; 7,424 KB
testcase_80	AC	68 ms; 7,424 KB
testcase_81	AC	68 ms; 7,424 KB
testcase_82	AC	69 ms; 7,424 KB
testcase_83	AC	68 ms; 7,424 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, ( $($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"));
}

/// 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> Default for ModInt<M> {
        fn default() -> Self { Self::new_internal(0) }
    }
    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)]
        pub struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD0: i64 = 1222311919;
const MOD1: i64 = 1579750427;
define_mod!(P0, MOD0);
define_mod!(P1, MOD1);
type MInt0 = mod_int::ModInt<P0>;
type MInt1 = mod_int::ModInt<P1>;

// https://yukicoder.me/problems/no/2592 (3)
// 剰余の定理から、摂取カロリーを x の多項式としてみたとき、x-k で割った余りと k を代入した値は等しい。
// その値を V とすると、V != 0 であれば x >> |V| + k とすれば必ずでぶにならないような x が存在する。
// V = 0 であれば必ずでぶになってしまうので、それをローリングハッシュで判定する。
// 本来であれば mod の素数を実行時にランダムに生成すべきだが、ここでは横着してランダムな固定値にしている。
fn main() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        n: usize, q: usize, k: i64,
        a: [i64; n],
        lr: [(usize1, usize); q],
    }
    let mut hash0 = vec![MInt0::new(0); n + 1];
    let mut hash1 = vec![MInt1::new(0); n + 1];
    let mut pw0 = vec![MInt0::new(1); n + 1];
    let mut pw1 = vec![MInt1::new(1); n + 1];
    for i in 0..n {
        pw0[i + 1] = pw0[i] * k;
        pw1[i + 1] = pw1[i] * k;
    }
    for i in (0..n).rev() {
        hash0[i] = hash0[i + 1] * k + (a[i] % MOD0 + MOD0);
        hash1[i] = hash1[i + 1] * k + (a[i] % MOD1 + MOD1);
    }
    for (l, r) in lr {
        let val0 = hash0[l] - hash0[r] * pw0[r - l];
        let val1 = hash1[l] - hash1[r] * pw1[r - l];
        puts!("{}\n", if val0.x != 0 || val1.x != 0 { "Yes" } else { "No" });
    }
}