#588069 (Rust) No.1304 あなたは基本が何か知っていますか？私は知っています．

提出ソース

結果

問題	No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー	akakimidori
提出日時	2020-12-02 02:25:50
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	35 ms / 2,000 ms
コード長	7,623 bytes
コンパイル時間	14,229 ms
コンパイル使用メモリ	405,192 KB
実行使用メモリ	10,276 KB
最終ジャッジ日時	2024-06-12 13:47:10
合計ジャッジ時間	13,884 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 10,112 KB
testcase_01	AC	8 ms 10,152 KB
testcase_02	AC	5 ms 10,240 KB
testcase_03	AC	35 ms 10,156 KB
testcase_04	AC	7 ms 10,112 KB
testcase_05	AC	6 ms 10,112 KB
testcase_06	AC	4 ms 10,112 KB
testcase_07	AC	7 ms 10,112 KB
testcase_08	AC	9 ms 10,152 KB
testcase_09	AC	7 ms 9,984 KB
testcase_10	AC	6 ms 10,112 KB
testcase_11	AC	7 ms 10,240 KB
testcase_12	AC	6 ms 10,240 KB
testcase_13	AC	6 ms 10,112 KB
testcase_14	AC	6 ms 10,112 KB
testcase_15	AC	6 ms 10,112 KB
testcase_16	AC	6 ms 10,112 KB
testcase_17	AC	7 ms 10,156 KB
testcase_18	AC	7 ms 10,240 KB
testcase_19	AC	6 ms 10,112 KB
testcase_20	AC	5 ms 10,112 KB
testcase_21	AC	9 ms 10,156 KB
testcase_22	AC	6 ms 10,240 KB
testcase_23	AC	7 ms 10,112 KB
testcase_24	AC	8 ms 10,240 KB
testcase_25	AC	16 ms 10,152 KB
testcase_26	AC	9 ms 10,152 KB
testcase_27	AC	10 ms 10,152 KB
testcase_28	AC	11 ms 10,148 KB
testcase_29	AC	10 ms 10,148 KB
testcase_30	AC	14 ms 10,156 KB
testcase_31	AC	21 ms 10,152 KB
testcase_32	AC	11 ms 10,276 KB
testcase_33	AC	17 ms 10,152 KB
testcase_34	AC	10 ms 10,152 KB
testcase_35	AC	14 ms 10,276 KB
testcase_36	AC	19 ms 10,148 KB
testcase_37	AC	15 ms 10,152 KB
testcase_38	AC	15 ms 10,152 KB
testcase_39	AC	26 ms 10,148 KB
testcase_40	AC	15 ms 10,024 KB
testcase_41	AC	24 ms 10,276 KB
testcase_42	AC	14 ms 10,028 KB
testcase_43	AC	14 ms 10,152 KB
testcase_44	AC	19 ms 10,152 KB
04_evil_A_01	RE	-
04_evil_A_02	RE	-
04_evil_A_03	RE	-
04_evil_A_04	RE	-
04_evil_A_05	RE	-
04_evil_A_06	RE	-
04_evil_A_07	RE	-
04_evil_A_08	RE	-
04_evil_A_09	RE	-
04_evil_A_10	RE	-
05_evil_B_01	RE	-
05_evil_B_02	RE	-
05_evil_B_03	RE	-
05_evil_B_04	RE	-
05_evil_B_05	RE	-
05_evil_B_06	RE	-
05_evil_B_07	RE	-
05_evil_B_08	RE	-
05_evil_B_09	RE	-
05_evil_B_10	RE	-
06_evil_C_01	RE	-
06_evil_C_02	RE	-
06_evil_C_03	RE	-
06_evil_C_04	RE	-
06_evil_C_05	RE	-
06_evil_C_06	RE	-
06_evil_C_07	RE	-
06_evil_C_08	RE	-
06_evil_C_09	RE	-
06_evil_C_10	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 998_244_353;
    }

    #[allow(dead_code)]
    pub struct StaticMod;
    static mut STATIC_MOD: u32 = 0;
    impl Modulo for StaticMod {
        fn modulo() -> u32 {
            unsafe { STATIC_MOD }
        }
    }

    #[allow(dead_code)]
    impl StaticMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                STATIC_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

    pub trait Modulo {
        fn modulo() -> u32;
    }

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

    pub struct ModInt<T>(pub u32, PhantomData<T>);

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::new_unchecked(self.0)
        }
    }

    impl<T> Copy for ModInt<T> {}

    impl<T: Modulo> Add for ModInt<T> {
        type Output = ModInt<T>;
        fn add(self, rhs: Self) -> Self::Output {
            let mut d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> AddAssign for ModInt<T> {
        fn add_assign(&mut self, rhs: Self) {
            *self = *self + rhs;
        }
    }

    impl<T: Modulo> Sub for ModInt<T> {
        type Output = ModInt<T>;
        fn sub(self, rhs: Self) -> Self::Output {
            let mut d = T::modulo() + self.0 - rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    impl<T: Modulo> SubAssign for ModInt<T> {
        fn sub_assign(&mut self, rhs: Self) {
            *self = *self - rhs;
        }
    }

    impl<T: Modulo> Mul for ModInt<T> {
        type Output = ModInt<T>;
        fn mul(self, rhs: Self) -> Self::Output {
            let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
            ModInt::new_unchecked(v as u32)
        }
    }

    impl<T: Modulo> MulAssign for ModInt<T> {
        fn mul_assign(&mut self, rhs: Self) {
            *self = *self * rhs;
        }
    }

    impl<T: Modulo> Neg for ModInt<T> {
        type Output = ModInt<T>;
        fn neg(self) -> Self::Output {
            if self.0 == 0 {
                Self::zero()
            } else {
                Self::new_unchecked(T::modulo() - self.0)
            }
        }
    }

    impl<T> std::fmt::Display for ModInt<T> {
        fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl<T: Modulo> std::str::FromStr for ModInt<T> {
        type Err = std::num::ParseIntError;
        fn from_str(s: &str) -> Result<Self, Self::Err> {
            let val = s.parse::<u32>()?;
            Ok(ModInt::new(val))
        }
    }

    impl<T: Modulo> From<usize> for ModInt<T> {
        fn from(val: usize) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as usize) as u32)
        }
    }

    impl<T: Modulo> From<u64> for ModInt<T> {
        fn from(val: u64) -> ModInt<T> {
            ModInt::new_unchecked((val % T::modulo() as u64) as u32)
        }
    }

    impl<T: Modulo> From<i64> for ModInt<T> {
        fn from(val: i64) -> ModInt<T> {
            let m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, PhantomData)
        }
        pub fn zero() -> Self {
            ModInt::new_unchecked(0)
        }
        pub fn one() -> Self {
            ModInt::new_unchecked(1)
        }
        pub fn is_zero(&self) -> bool {
            self.0 == 0
        }
    }

    #[allow(dead_code)]
    impl<T: Modulo> ModInt<T> {
        pub fn new(d: u32) -> Self {
            ModInt::new_unchecked(d % T::modulo())
        }
        pub fn pow(&self, mut n: u64) -> Self {
            let mut t = Self::one();
            let mut s = *self;
            while n > 0 {
                if n & 1 == 1 {
                    t *= s;
                }
                s *= s;
                n >>= 1;
            }
            t
        }
        pub fn inv(&self) -> Self {
            assert!(self.0 != 0);
            self.pow(T::modulo() as u64 - 2)
        }
    }

    #[allow(dead_code)]
    pub fn mod_pow(r: u64, mut n: u64, m: u64) -> u64 {
        let mut t = 1 % m;
        let mut s = r % m;
        while n > 0 {
            if n & 1 == 1 {
                t = t * s % m;
            }
            s = s * s % m;
            n >>= 1;
        }
        t
    }
}
// ---------- end ModInt ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use modint::*;
type M = ModInt<Mod>;

fn saturating_pow(r: usize, n: usize) -> usize {
    (0..n).fold(1usize, |s, _| s.saturating_mul(r))
}

fn run() {
    input! {
        n: usize,
        k: usize,
        x: usize,
        y: usize,
        a: [usize; k],
    }
    assert!(2 <= n && n <= 40);
    assert!(n % 2 == 0);
    assert!(1 <= k && k <= 200000);
    assert!(a.iter().all(|a| *a <= 1023));
    assert!(x <= y && y <= 1_000_000_000);
    assert!(saturating_pow(k, n) <= 2_000_000_000_000_000);
    let mut a = a;
    a.sort();
    a.dedup();
    let w = 1 << 10;
    let mut dp = vec![vec![M::zero(); w]; w];
    let mut sum = vec![M::zero(); w];
    for &a in a.iter() {
        dp[a][a] += M::one();
        sum[a] += M::one();
    }
    for _ in 1..n {
        let mut next = vec![vec![M::zero(); w]; w];
        let mut next_sum = vec![M::zero(); w];
        for &a in a.iter() {
            for j in 0..w {
                let xor = j ^ a;
                next[a][xor] = sum[j] - dp[a][j];
                next_sum[xor] += next[a][xor];
            }
        }
        dp = next;
        sum = next_sum;
    }
    let mut ans = M::zero();
    for i in 0..w {
        if x <= i && i <= y {
            ans += sum[i];
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}

yukicoder

結果

テストケース

ソースコード