結果

問題 No.2215 Slide Subset Sum
ユーザー akakimidoriakakimidori
提出日時 2023-02-10 21:27:50
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,215 ms / 3,000 ms
コード長 10,738 bytes
コンパイル時間 4,471 ms
コンパイル使用メモリ 159,192 KB
実行使用メモリ 131,828 KB
最終ジャッジ日時 2023-09-21 22:31:07
合計ジャッジ時間 24,909 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 108 ms
4,376 KB
testcase_01 AC 236 ms
4,452 KB
testcase_02 AC 664 ms
4,624 KB
testcase_03 AC 596 ms
4,444 KB
testcase_04 AC 1,067 ms
7,444 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 1 ms
4,376 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 1 ms
4,380 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 947 ms
65,424 KB
testcase_18 AC 1,046 ms
57,216 KB
testcase_19 AC 1,062 ms
6,536 KB
testcase_20 AC 881 ms
70,588 KB
testcase_21 AC 1,215 ms
19,668 KB
testcase_22 AC 851 ms
75,548 KB
testcase_23 AC 390 ms
122,664 KB
testcase_24 AC 383 ms
123,168 KB
testcase_25 AC 549 ms
110,448 KB
testcase_26 AC 836 ms
76,020 KB
testcase_27 AC 36 ms
4,376 KB
testcase_28 AC 22 ms
7,072 KB
testcase_29 AC 60 ms
4,852 KB
testcase_30 AC 293 ms
4,380 KB
testcase_31 AC 93 ms
46,724 KB
testcase_32 AC 80 ms
4,376 KB
testcase_33 AC 718 ms
13,544 KB
testcase_34 AC 468 ms
35,208 KB
testcase_35 AC 97 ms
4,376 KB
testcase_36 AC 94 ms
21,536 KB
testcase_37 AC 177 ms
131,828 KB
testcase_38 AC 25 ms
18,136 KB
testcase_39 AC 238 ms
4,448 KB
testcase_40 AC 43 ms
4,380 KB
testcase_41 AC 1 ms
4,376 KB
testcase_42 AC 876 ms
70,456 KB
testcase_43 AC 930 ms
8,912 KB
testcase_44 AC 939 ms
8,856 KB
testcase_45 AC 599 ms
104,240 KB
testcase_46 AC 602 ms
104,316 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: type alias `Map` is never used
 --> Main.rs:4:6
  |
4 | type Map<K, V> = BTreeMap<K, V>;
  |      ^^^
  |
  = note: `#[warn(dead_code)]` on by default

warning: type alias `Set` is never used
 --> Main.rs:5:6
  |
5 | type Set<T> = BTreeSet<T>;
  |      ^^^

warning: type alias `Deque` is never used
 --> Main.rs:6:6
  |
6 | type Deque<T> = VecDeque<T>;
  |      ^^^^^

warning: 3 warnings emitted

ソースコード

diff # 

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        m: usize,
        k: usize,
        a: [usize; n],
    }
    let solver = Solver::new(k);
    let mut solver = QueueLikeUndoDS::new(solver);
    for a in a.iter().take(m) {
        solver.enqueue(*a);
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    writeln!(out, "{}", solver.find()).ok();
    for a in a[m..].iter() {
        solver.enqueue(*a);
        solver.dequeue();
        writeln!(out, "{}", solver.find()).ok();
    }

}

struct Solver {
    dp: Vec<Vec<M>>,
}

impl Solver {
    pub fn new(k: usize) -> Self {
        let mut a = vec![M::zero(); k];
        a[0] = M::one();
        Solver {
            dp: vec![a],
        }
    }
    pub fn find(&self) -> M {
        self.dp.last().unwrap()[0] - M::one()
    }
}

impl UndoDS for Solver {
    type Arg = usize;
    fn update(&mut self, v: Self::Arg) {
        let dp = self.dp.last().unwrap();
        let mut next = vec![M::zero(); dp.len() + v];
        for (i, dp) in dp.iter().enumerate() {
            next[i] += *dp;
            next[i + v] += *dp;
        }
        for i in (dp.len()..next.len()).rev() {
            let v = next.pop().unwrap();
            next[i - dp.len()] += v;
        }
        self.dp.push(next);
    }
    fn undo(&mut self) {
        self.dp.pop();
    }
}

fn main() {
    run();
}

// ---------- 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 queue-like undoing ds ----------
// reference: https://codeforces.com/blog/entry/83467?#comment-711760
pub trait UndoDS {
    type Arg;
    fn update(&mut self, arg: Self::Arg);
    fn undo(&mut self);
}

pub struct QueueLikeUndoDS<DS: UndoDS> {
    data: DS,
    memo: Vec<(DS::Arg, u8)>,
    rem: usize,
}

impl<DS> QueueLikeUndoDS<DS>
where
    DS: UndoDS,
    DS::Arg: Clone,
{
    pub fn new(data: DS) -> Self {
        Self {
            data: data,
            memo: vec![],
            rem: 0,
        }
    }
    pub fn enqueue(&mut self, arg: DS::Arg) {
        self.data.update(arg.clone());
        self.memo.push((arg, 0));
    }
    pub fn dequeue(&mut self) {
        assert!(!self.memo.is_empty());
        let mut args = vec![];
        if self.rem == 0 {
            for (a, _) in self.memo.drain(..) {
                self.data.undo();
                args.push((a, 1));
            }
            self.rem = args.len();
        } else {
            while self.memo.last().unwrap().1 == 0 {
                self.data.undo();
                args.push(self.memo.pop().unwrap());
            }
            let c = self.rem & (!self.rem + 1);
            for _ in 0..c {
                let p = self.memo.pop().unwrap();
                assert!(p.1 == 1);
                self.data.undo();
                args.push(p);
            }
            args.rotate_right(c);
        }
        for (arg, p) in args.drain(..).rev() {
            self.data.update(arg.clone());
            self.memo.push((arg, p));
        }
        self.data.undo();
        self.memo.pop();
        self.rem -= 1;
    }
}

impl<DS: UndoDS> std::ops::Deref for QueueLikeUndoDS<DS> {
    type Target = DS;
    fn deref(&self) -> &Self::Target {
        &self.data
    }
}
// ---------- end queue-like undoing ds ----------
0