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

提出ソース

結果

問題	No.1304 あなたは基本が何か知っていますか？私は知っています．
ユーザー	akakimidori
提出日時	2023-04-29 09:18:34
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	1 ms / 2,000 ms
コード長	9,776 bytes
コンパイル時間	11,347 ms
コンパイル使用メモリ	401,752 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-12 18:16:12
合計ジャッジ時間	16,033 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	0 ms 6,812 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	1 ms 6,812 KB
testcase_03	AC	0 ms 6,940 KB
testcase_04	AC	1 ms 6,944 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	1 ms 6,944 KB
testcase_08	AC	1 ms 6,940 KB
testcase_09	AC	1 ms 6,944 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	1 ms 6,944 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	1 ms 6,940 KB
testcase_14	AC	1 ms 6,940 KB
testcase_15	AC	1 ms 6,940 KB
testcase_16	AC	1 ms 6,948 KB
testcase_17	AC	0 ms 6,944 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	1 ms 6,940 KB
testcase_22	AC	1 ms 6,940 KB
testcase_23	AC	0 ms 6,940 KB
testcase_24	AC	1 ms 6,944 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,944 KB
testcase_32	AC	1 ms 6,940 KB
testcase_33	AC	1 ms 6,944 KB
testcase_34	AC	1 ms 6,944 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,944 KB
testcase_40	AC	1 ms 6,944 KB
testcase_41	AC	1 ms 6,940 KB
testcase_42	AC	1 ms 6,944 KB
testcase_43	AC	1 ms 6,944 KB
testcase_44	AC	1 ms 6,940 KB
04_evil_A_01	AC	26 ms 6,940 KB
04_evil_A_02	AC	23 ms 6,940 KB
04_evil_A_03	AC	24 ms 6,940 KB
04_evil_A_04	AC	22 ms 6,948 KB
04_evil_A_05	AC	12 ms 6,940 KB
04_evil_A_06	AC	12 ms 6,944 KB
04_evil_A_07	AC	13 ms 6,940 KB
04_evil_A_08	AC	12 ms 6,944 KB
04_evil_A_09	AC	12 ms 6,944 KB
04_evil_A_10	AC	11 ms 6,944 KB
05_evil_B_01	AC	32 ms 6,940 KB
05_evil_B_02	AC	30 ms 6,940 KB
05_evil_B_03	AC	31 ms 6,944 KB
05_evil_B_04	AC	33 ms 7,296 KB
05_evil_B_05	AC	32 ms 6,940 KB
05_evil_B_06	AC	31 ms 6,940 KB
05_evil_B_07	AC	31 ms 6,944 KB
05_evil_B_08	AC	30 ms 6,940 KB
05_evil_B_09	AC	33 ms 6,944 KB
05_evil_B_10	AC	35 ms 7,680 KB
06_evil_C_01	AC	198 ms 7,680 KB
06_evil_C_02	AC	186 ms 6,940 KB
06_evil_C_03	AC	176 ms 6,940 KB
06_evil_C_04	AC	184 ms 6,940 KB
06_evil_C_05	AC	183 ms 6,940 KB
06_evil_C_06	AC	184 ms 6,944 KB
06_evil_C_07	AC	187 ms 6,940 KB
06_evil_C_08	AC	182 ms 6,940 KB
06_evil_C_09	AC	188 ms 6,940 KB
06_evil_C_10	AC	1 ms 6,940 KB

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

ソースコード

raw source code

fn main() {
    input! {
        n: usize,
        k: usize,
        x: usize,
        y: usize,
        a: [usize; k],
    }
    if n == 1 {
        let ans = a.iter().filter(|&a| x <= *a && *a <= y).count();
        println!("{}", ans);
        return;
    }
    let m = std::cmp::max(*a.iter().max().unwrap(), y).next_power_of_two();
    let mut h = vec![M::zero(); m];
    for a in a.iter() {
        h[*a] += M::one();
    }
    fwht(&mut h);
    let mut g = h.iter().map(|h| *h * *h).collect::<Vec<_>>();
    fwht(&mut g);
    let inv = M::from(m).inv();
    g.iter_mut().for_each(|g| *g *= inv);
    g[0] = M::zero();
    fwht(&mut g);
    for (g, h) in g.iter_mut().zip(h.iter()) {
        let mut dp = [*g, *h];
        let mut r = [[*h, -M::from(k - 1)], [M::one(), M::zero()]];
        let mut n = n - 2;
        while n > 0 {
            if n & 1 == 1 {
                let mut next = [M::zero(); 2];
                for (next, r) in next.iter_mut().zip(r.iter()) {
                    for (r, dp) in r.iter().zip(dp.iter()) {
                        *next += *dp * *r;
                    }
                }
                dp = next;
            }
            let mut next = [[M::zero(); 2]; 2];
            for (next, a) in next.iter_mut().zip(r.iter()) {
                for (a, b) in a.iter().zip(r.iter()) {
                    for (next, b) in next.iter_mut().zip(b.iter()) {
                        *next += *a * *b;
                    }
                }
            }
            r = next;
            n >>= 1;
        }
        *g = dp[0];
    }
    fwht(&mut g);
    let inv = M::from(m).inv();
    g.iter_mut().for_each(|g| *g *= inv);
    let ans = g[x..=y].iter().fold(M::zero(), |s, a| s + *a);
    println!("{}", ans);
}

fn fwht(a: &mut [M]) {
    bitwise_transform(a, |a, b| {
        let x = *a + *b;
        let y = *a - *b;
        *a = x;
        *b = y;
    });
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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_export]
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_export]
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 ----------
// ---------- begin modint ----------
use std::marker::*;
use std::ops::*;

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

pub struct ConstantModulo<const M: u32>;

impl<const M: u32> Modulo for ConstantModulo<{ M }> {
    fn modulo() -> u32 {
        M
    }
}

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

impl<T> Clone for ModInt<T> {
    fn clone(&self) -> Self {
        Self::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 v = self.0 + rhs.0;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        Self::new_unchecked(v)
    }
}

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 v = self.0 - rhs.0;
        if self.0 < rhs.0 {
            v += T::modulo();
        }
        Self::new_unchecked(v)
    }
}

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;
        Self::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.is_zero() {
            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> std::fmt::Debug for ModInt<T> {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl<T> Default for ModInt<T> {
    fn default() -> Self {
        Self::zero()
    }
}

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 mut v = ((val % T::modulo() as i64) + T::modulo() as i64) as u32;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        ModInt::new_unchecked(v)
    }
}

impl<T> ModInt<T> {
    pub fn new_unchecked(n: u32) -> Self {
        ModInt(n, 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
    }
}

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.is_zero());
        self.pow(T::modulo() as u64 - 2)
    }
    pub fn fact(n: usize) -> Self {
        (1..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn perm(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        ((n - k + 1)..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn binom(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        let k = k.min(n - k);
        let mut nu = Self::one();
        let mut de = Self::one();
        for i in 0..k {
            nu *= Self::from(n - i);
            de *= Self::from(i + 1);
        }
        nu * de.inv()
    }
}
// ---------- end modint ----------
// ---------- begin precalc ----------
pub struct Precalc<T> {
    fact: Vec<ModInt<T>>,
    ifact: Vec<ModInt<T>>,
    inv: Vec<ModInt<T>>,
}

impl<T: Modulo> Precalc<T> {
    pub fn new(n: usize) -> Precalc<T> {
        let mut inv = vec![ModInt::one(); n + 1];
        let mut fact = vec![ModInt::one(); n + 1];
        let mut ifact = vec![ModInt::one(); n + 1];
        for i in 2..=n {
            fact[i] = fact[i - 1] * ModInt::new_unchecked(i as u32);
        }
        ifact[n] = fact[n].inv();
        if n > 0 {
            inv[n] = ifact[n] * fact[n - 1];
        }
        for i in (1..n).rev() {
            ifact[i] = ifact[i + 1] * ModInt::new_unchecked((i + 1) as u32);
            inv[i] = ifact[i] * fact[i - 1];
        }
        Precalc { fact, ifact, inv }
    }
    pub fn inv(&self, n: usize) -> ModInt<T> {
        assert!(n > 0);
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt<T> {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt<T> {
        self.ifact[n]
    }
    pub fn perm(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[n - k]
    }
    pub fn binom(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end precalc ----------

type M = ModInt<ConstantModulo<998_244_353>>;

// ---------- begin bitwise transform ----------
pub fn bitwise_transform<T, F>(a: &mut [T], mut f: F)
where
    F: FnMut(&mut T, &mut T),
{
    let n = a.len().trailing_zeros() as usize;
    assert!(a.len() == 1 << n);
    for i in 0..n {
        for a in a.chunks_exact_mut(2 << i) {
            let (x, y) = a.split_at_mut(1 << i);
            for (x, y) in x.iter_mut().zip(y) {
                f(x, y);
            }
        }
    }
}
// ---------- end bitwise transform ----------

yukicoder

結果

テストケース

ソースコード