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

• 問題: No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
• ユーザー: cotton_fn_
• 提出日時: 2020-06-01 21:23:05
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 798 ms / 3,500 ms
• コード長: 6,897 bytes
• コンパイル時間: 16,493 ms
• コンパイル使用メモリ: 382,632 KB
• 実行使用メモリ: 21,504 KB
• 最終ジャッジ日時: 2024-11-22 10:32:14
• 合計ジャッジ時間: 31,722 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	12 ms; 5,248 KB
testcase_04	AC	8 ms; 5,248 KB
testcase_05	AC	9 ms; 5,248 KB
testcase_06	AC	8 ms; 5,248 KB
testcase_07	AC	7 ms; 5,248 KB
testcase_08	AC	9 ms; 5,248 KB
testcase_09	AC	10 ms; 5,248 KB
testcase_10	AC	5 ms; 5,248 KB
testcase_11	AC	7 ms; 5,248 KB
testcase_12	AC	5 ms; 5,248 KB
testcase_13	AC	798 ms; 21,248 KB
testcase_14	AC	788 ms; 21,248 KB
testcase_15	AC	789 ms; 21,248 KB
testcase_16	AC	787 ms; 21,120 KB
testcase_17	AC	787 ms; 21,248 KB
testcase_18	AC	788 ms; 21,248 KB
testcase_19	AC	789 ms; 21,248 KB
testcase_20	AC	791 ms; 21,120 KB
testcase_21	AC	788 ms; 21,120 KB
testcase_22	AC	794 ms; 21,248 KB
testcase_23	AC	797 ms; 21,248 KB
testcase_24	AC	798 ms; 21,248 KB
testcase_25	AC	790 ms; 21,248 KB
testcase_26	AC	786 ms; 21,120 KB
testcase_27	AC	789 ms; 21,120 KB
testcase_28	AC	788 ms; 21,504 KB
testcase_29	AC	777 ms; 19,456 KB
testcase_30	AC	778 ms; 19,328 KB
testcase_31	AC	1 ms; 5,248 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    let (n, q): (usize, usize) = kin.input();
    let mut ps = Vec::new();
    for a in kin.iter::<i64>().take(n) {
        ps.push(vec![a - 1, 1]);
    }
    let dft = Dft::new(n + 1);
    while ps.len() >= 2 {
        let mut ps_new = Vec::new();
        while ps.len() >= 2 {
            let mut a = ps.pop().unwrap();
            let mut b = ps.pop().unwrap();
            dft.convolution(&mut a, &mut b);
            ps_new.push(a);
        }
        if !ps.is_empty() {
            ps_new.push(ps.pop().unwrap());
        }
        ps = ps_new;
    }
    let a = ps.pop().unwrap();
    for b in kin.iter::<usize>().take(q) {
        outputln!("{}", a[b]);
    }
}

const P: i64 = 998244353; // 2^23 * 7 * 17 + 1
const PR: i64 = 3;
pub struct Dft {
    w: Vec<i64>,
}
impl Dft {
    pub fn new(n: usize) -> Self {
        let n = n.next_power_of_two();
        let r = mod_pow(PR, P >> n.trailing_zeros(), P);
        Self {
            w: iter::successors(Some(1), |&w| Some(w * r % P))
                .take(n)
                .collect(),
        }
    }
    pub fn dft(&self, a: &mut [i64], inv: bool) {
        // Cooley–Tukey FFT
        debug_assert!(a.len().is_power_of_two());
        let n = a.len();
        for i in 0..n {
            let j = i.reverse_bits().wrapping_shr(n.leading_zeros() + 1);
            if i < j {
                a.swap(i, j);
            }
        }
        let mut w = Vec::<i64>::with_capacity(n / 2);
        w.push(1);
        for k in (1..).map(|d| 1 << d).take_while(|&k| k <= n) {
            w.truncate(1);
            let it = self.w.iter().step_by(self.w.len() / k);
            if inv {
                w.extend(it.skip(1).take(k / 2 - 1));
            } else {
                w.extend(it.rev().take(k / 2 - 1));
            }
            for ofs in (0..n).step_by(k) {
                for i in 0..k / 2 {
                    let l = ofs + i;
                    let r = ofs + i + k / 2;
                    let t = w[i] * a[r];
                    a[r] = (a[l] - t).rem_euclid(P);
                    a[l] = (a[l] + t) % P;
                }
            }
        }
        if inv {
            let d = mod_pow(n as i64, P - 2, P);
            for v in a {
                *v = d * *v % P;
            }
        }
    }
    pub fn convolution(&self, a: &mut Vec<i64>, b: &mut Vec<i64>) {
        let n = a.len() + b.len() - 1;
        let m = n.next_power_of_two();
        a.resize(m, 0);
        b.resize(m, 0);
        self.dft(a, false);
        self.dft(b, false);
        for (x, y) in a.iter_mut().zip(b.iter()) {
            *x = *x * *y % P;
        }
        self.dft(a, true);
        a.truncate(n);
    }
}
pub fn mod_pow(mut a: i64, mut b: i64, m: i64) -> i64 {
    let mut y = 1;
    while b > 0 {
        if b & 1 == 1 {
            y = y * a % m;
        }
        a = a * a % m;
        b >>= 1;
    }
    y
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
        pub fn src(&mut self) -> &mut R {
            &mut self.src
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}