#592000 (Rust) No.1307 Rotate and Accumulate

• 問題: No.1307 Rotate and Accumulate
• ユーザー: koba-e964
• 提出日時: 2020-12-11 02:34:45
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,918 ms / 5,000 ms
• コード長: 8,932 bytes
• コンパイル時間: 12,630 ms
• コンパイル使用メモリ: 401,240 KB
• 実行使用メモリ: 10,428 KB
• 最終ジャッジ日時: 2024-09-19 21:05:45
• 合計ジャッジ時間: 28,319 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	1 ms; 6,816 KB
testcase_03	AC	1 ms; 6,812 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	847 ms; 7,760 KB
testcase_09	AC	894 ms; 8,200 KB
testcase_10	AC	578 ms; 6,940 KB
testcase_11	AC	760 ms; 7,284 KB
testcase_12	AC	592 ms; 6,944 KB
testcase_13	AC	25 ms; 6,940 KB
testcase_14	AC	193 ms; 6,944 KB
testcase_15	AC	1,884 ms; 10,420 KB
testcase_16	AC	1,905 ms; 10,424 KB
testcase_17	AC	1,893 ms; 10,296 KB
testcase_18	AC	1,887 ms; 10,424 KB
testcase_19	AC	1,904 ms; 10,424 KB
testcase_20	AC	1,918 ms; 10,428 KB
testcase_21	AC	1 ms; 6,944 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, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($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"));
}

#[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 MInt = mod_int::ModInt<P>;

// https://atcoder.jp/contests/joisc2007/submissions/18675713
fn karatsuba_convolution_sub(a: &[MInt], b: &[MInt], out: &mut [MInt]) {
    let n = a.len();
    let m = b.len();
    if n == 0 || m == 0 {
        return;
    }
    if min(n, m) <= 5 {
        for i in 0..n {
            for j in 0..m {
                if i + j < out.len() {
                    out[i + j] += a[i] * b[j];
                }
            }
        }
        return;
    }
    let l = max(n, m);
    let al = &a[..min(a.len(), l / 2)];
    let bl = &b[..min(b.len(), l / 2)];
    let ah = &a[min(a.len(), l / 2)..];
    let bh = &b[min(b.len(), l / 2)..];
    if ah.is_empty() || bh.is_empty() {
        karatsuba_convolution_sub(&al, &bl, out);
        if out.len() >= l / 2 {
            karatsuba_convolution_sub(&al, &bh, &mut out[l / 2..]);
            karatsuba_convolution_sub(&ah, &bl, &mut out[l / 2..]);
            if out.len() >= l / 2 * 2 {
                karatsuba_convolution_sub(&ah, &bh, &mut out[l / 2 * 2..]);
            }
        }
        return;
    }
    let mut lo = vec![MInt::new(0); al.len() + bl.len()];
    karatsuba_convolution_sub(&al, &bl, &mut lo);
    let mut hi = vec![MInt::new(0); ah.len() + bh.len()];
    karatsuba_convolution_sub(&ah, &bh, &mut hi);
    // al * bh + ah * bl = al * bl + ah * bh - (al - ah) * (bl - bh)
    let mut dif_a = vec![MInt::new(0); l - l / 2]; // ah - al
    let mut dif_b = vec![MInt::new(0); l - l / 2]; // bl - bh
    for i in 0..l / 2 {
        if i < al.len() {
            dif_a[i] = -al[i];
        }
        if i < bl.len() {
            dif_b[i] = bl[i];
        }
    }
    for i in 0..l - l / 2 {
        if i < ah.len() {
            dif_a[i] += ah[i];
        }
        if i < bh.len() {
            dif_b[i] -= bh[i];
        }
    }
    if out.len() > l / 2 {
        karatsuba_convolution_sub(&dif_a, &dif_b, &mut out[l / 2..]);
    }
    for i in 0..min(lo.len(), out.len()) {
        out[i] += lo[i];
        if i + l / 2 < out.len() {
            out[i + l / 2] += lo[i];
        }
    }
    for i in 0..min(hi.len(), out.len()) {
        if i + l / 2 * 2 < out.len() {
            out[i + l / 2 * 2] += hi[i];
        }
        if i + l / 2 < out.len() {
            out[i + l / 2] += hi[i];
        }
    }
}
fn karatsuba_convolution(a: &[MInt], b: &[MInt]) -> Vec<MInt> {
    let n = a.len();
    let m = b.len();
    let mut ret = vec![MInt::new(0); n + m - 1];
    karatsuba_convolution_sub(a, b, &mut ret);
    ret
}

// Tags: fft, convolution, karatsuba
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,
        a: [i64; n],
        r: [usize; q],
    }
    let mut f = vec![MInt::new(0); n];
    let mut g = vec![MInt::new(0); n + 1];
    for i in 0..n {
        f[i] += a[i];
    }
    for r in r {
        g[n - r] += 1;
    }
    let res = karatsuba_convolution(&f, &g);
    let mut ans = vec![MInt::new(0); n];
    for i in 0..res.len() {
        ans[i % n] += res[i];
    }
    for i in 0..n {
        puts!("{}{}", ans[i], if i + 1 == n { "\n" } else { " " });
    }
}