#489492 (Rust) No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)

• 問題: No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
• ユーザー: koba-e964
• 提出日時: 2020-05-30 08:32:09
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 629 ms / 3,500 ms
• コード長: 9,363 bytes
• コンパイル時間: 3,808 ms
• コンパイル使用メモリ: 177,536 KB
• 実行使用メモリ: 23,328 KB
• 最終ジャッジ日時: 2024-04-24 17:41:05
• 合計ジャッジ時間: 16,607 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	11 ms; 5,376 KB
testcase_04	AC	7 ms; 5,376 KB
testcase_05	AC	8 ms; 5,376 KB
testcase_06	AC	6 ms; 5,376 KB
testcase_07	AC	6 ms; 5,376 KB
testcase_08	AC	7 ms; 5,376 KB
testcase_09	AC	8 ms; 5,376 KB
testcase_10	AC	3 ms; 5,376 KB
testcase_11	AC	6 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	613 ms; 23,196 KB
testcase_14	AC	607 ms; 23,200 KB
testcase_15	AC	607 ms; 23,200 KB
testcase_16	AC	629 ms; 23,200 KB
testcase_17	AC	603 ms; 23,168 KB
testcase_18	AC	598 ms; 23,196 KB
testcase_19	AC	610 ms; 23,072 KB
testcase_20	AC	607 ms; 23,200 KB
testcase_21	AC	605 ms; 23,196 KB
testcase_22	AC	594 ms; 23,328 KB
testcase_23	AC	602 ms; 23,204 KB
testcase_24	AC	594 ms; 23,072 KB
testcase_25	AC	599 ms; 23,196 KB
testcase_26	AC	606 ms; 23,196 KB
testcase_27	AC	596 ms; 23,204 KB
testcase_28	AC	603 ms; 23,204 KB
testcase_29	AC	583 ms; 23,072 KB
testcase_30	AC	587 ms; 23,196 KB
testcase_31	AC	1 ms; 5,376 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);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
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 = 998_244_353;
define_mod!(P, MOD);
type ModInt = mod_int::ModInt<P>;

/// FFT (in-place, verified as NTT only)
/// R: Ring + Copy
/// Verified by: https://codeforces.com/contest/1096/submission/47672373
mod fft {
    use std::ops::*;
    /// n should be a power of 2. zeta is a primitive n-th root of unity.
    /// one is unity
    /// Note that the result should be multiplied by 1/sqrt(n).
    #[inline(always)]
    pub fn transform<R>(f: &mut [R], zeta: R, one: R)
        where R: Copy +
        Add<Output = R> +
        Sub<Output = R> +
        Mul<Output = R> {
        let n = f.len();
        assert!(n.is_power_of_two());
        {
            let mut i = 0;
            for j in 1 .. n - 1 {
                let mut k = n >> 1;
                loop {
                    i ^= k;
                    if k <= i { break; }
                    k >>= 1;
                }
                if j < i {
                    f.swap(i, j);
                }
            }
        }
        let mut zetapow = Vec::with_capacity(20);
        {
            let mut m = 1;
            let mut cur = zeta;
            while m < n {
                zetapow.push(cur);
                cur = cur * cur;
                m *= 2;
            }
        }
        let mut m = 1;
        unsafe {
            while m < n {
                let base = zetapow.pop().unwrap();
                let mut r = 0;
                while r < n {
                    let mut w = one;
                    for s in r..r + m {
                        let &u = f.get_unchecked(s);
                        let d = *f.get_unchecked(s + m) * w;
                        *f.get_unchecked_mut(s) = u + d;
                        *f.get_unchecked_mut(s + m) = u - d;
                        w = w * base;
                    }
                    r += 2 * m;
                }
                m *= 2;
            }
        }
    }
}

fn conv(a: &[ModInt], b: &[ModInt]) -> Vec<ModInt> {
    let n = a.len() - 1;
    let m = b.len() - 1;
    const THRESH: usize = 0;
    if n + m < THRESH {
        let mut c = vec![ModInt::new(0); n + m + 1];
        for i in 0..n + 1 {
            for j in 0..m + 1 {
                c[i + j] += a[i] * b[j];
            }
        }
        return c;
    }
    let mut p2 = 1;
    while n + m + 1 > p2 {
        p2 *= 2;
    }
    let mut atmp = vec![ModInt::new(0); p2];
    let mut btmp = vec![ModInt::new(0); p2];
    for i in 0..n + 1 {
        atmp[i] = a[i];
    }
    for j in 0..m + 1 {
        btmp[j] = b[j];
    }
    let zeta = ModInt::new(3).pow((MOD - 1) / p2 as i64);
    fft::transform(&mut atmp, zeta, 1.into());
    fft::transform(&mut btmp, zeta, 1.into());
    let fac = ModInt::new(p2 as i64).inv();
    for i in 0..p2 {
        atmp[i] *= btmp[i] * fac;
    }
    fft::transform(&mut atmp, zeta.inv(), 1.into());
    atmp[..n + m + 1].to_vec()
}

fn dc(ps: &[Vec<ModInt>]) -> Vec<ModInt> {
    if ps.len() == 1 {
        return ps[0].to_vec();
    }
    if ps.len() == 0 {
        return vec![ModInt::new(1)];
    }
    let mid = ps.len() / 2;
    let a = dc(&ps[..mid]);
    let b = dc(&ps[mid..]);
    conv(&a, &b)
}

fn solve() {
    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,
        a: [i64; n],
        b: [usize; q],
    }
    let mut poly = vec![vec![]; n];
    for i in 0..n {
        poly[i] = vec![ModInt::new(a[i] - 1), ModInt::new(1)];
    }
    let ans = dc(&poly);
    for b in b {
        puts!("{}\n", ans[b]);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}