結果

問題 No.1117 数列分割
ユーザー nebocco
提出日時 2021-02-18 19:44:06
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 585 ms / 3,000 ms
コード長 9,697 bytes
コンパイル時間 13,650 ms
コンパイル使用メモリ 376,752 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-15 01:08:02
合計ジャッジ時間 16,927 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

fn main() {
    let mut io = IO::new();
    input!{ from io,
        n: usize, k: usize, m: usize,
        a: [i64; n]
    }
    let mut b = vec![0; n+1];
    for i in 0..n {
        b[i+1] = b[i] + a[i];
    }
    let mut dp = vec![-1_000_000_000_000_000; n+1];
    dp[0] = 0;
    let mut plul = SWAG::<Ma>::new();
    let mut minl = SWAG::<Ma>::new();
    for lim in 0..k {
        plul.clear();
        minl.clear();
        for i in (n-m+1..=n).rev() {
            plul.push(Ma(dp[i] + b[i]));
            minl.push(Ma(dp[i] - b[i]));
        }
        for i in (0..=n).rev() {
            plul.pop();
            minl.pop();
            if i >= m {
                plul.push(Ma(dp[i-m] + b[i-m]));
                minl.push(Ma(dp[i-m] - b[i-m]));
            }
            dp[i] = if i <= lim {
                - 1_000_000_000_000_000
            } else {
                std::cmp::max(
                    minl.fold_all().unwrap().0 + b[i],
                    plul.fold_all().unwrap().0 - b[i]
                )
            };
        }
    }
    io.println(dp[n]);
}
#[derive(Clone, Copy, PartialEq)]
struct Ma(i64);
impl Add for Ma {
    type Output = Self;
    fn add(self, rhs: Self) -> Self::Output {
        Self(std::cmp::max(self.0, rhs.0))
    }
}
impl Associative for Ma {}
// ------------ SWAG start ------------
#[derive(Default)]
pub struct SWAG<T: SemiGroup> {
    front: Vec<(T, T)>,
    back: Vec<(T, T)>,
}
impl<T: SemiGroup> SWAG<T> {
    pub fn new() -> Self {
        Self {
            front: Vec::new(),
            back: Vec::new(),
        }
    }
    pub fn len(&self) -> usize {
        self.front.len() + self.back.len()
    }
    pub fn is_empty(&self) -> bool {
        self.front.is_empty() && self.back.is_empty()
    }
    pub fn clear(&mut self) {
        self.front.clear();
        self.back.clear();
    }
    pub fn push(&mut self, v: T) {
        let s = if let Some((_, x)) = self.back.last() {
            x.clone() + v.clone()
        } else {
            v.clone()
        };
        self.back.push((v, s));
    }
    pub fn pop(&mut self) -> Option<T> {
        if self.front.is_empty() {
            let back = std::mem::replace(&mut self.back, Vec::new());
            for (v, _) in back.into_iter().rev() {
                let s = if let Some((_, x)) = self.front.last() {
                    v.clone() + x.clone()
                } else {
                    v.clone()
                };
                self.front.push((v, s));
            }
            // self.back.clear();
        }
        if let Some((x, _)) = self.front.pop() {
            Some(x)
        } else {
            None
        }
    }
    pub fn fold_all(&self) -> Option<T> {
        match (self.front.last(), self.back.last()) {
            (Some(u), Some(v)) => Some(u.1.clone() + v.1.clone()),
            (Some(u), None) => Some(u.1.clone()),
            (None, Some(v)) => Some(v.1.clone()),
            (None, None) => None,
        }
    }
}
// ------------ SWAG end ------------
// ------------ algebraic traits start ------------
use std::marker::Sized;
use std::ops::*;
/// 元
pub trait Element: Sized + Clone + PartialEq {}
impl<T: Sized + Clone + PartialEq> Element for T {}
/// 結合性
pub trait Associative: Magma {}
/// マグマ
pub trait Magma: Element + Add<Output=Self> {}
impl<T: Element + Add<Output=Self>> Magma for T {}
/// 半群
pub trait SemiGroup: Magma + Associative {}
impl<T: Magma + Associative> SemiGroup for T {}
/// モノイド
pub trait Monoid: SemiGroup + Zero {}
impl<T: SemiGroup + Zero> Monoid for T {}
pub trait ComMonoid: Monoid + AddAssign {}
impl<T: Monoid + AddAssign> ComMonoid for T {}
/// 群
pub trait Group: Monoid + Neg<Output=Self> {}
impl<T: Monoid + Neg<Output=Self>> Group for T {}
pub trait ComGroup: Group + ComMonoid {}
impl<T: Group + ComMonoid> ComGroup for T {}
/// 半環
pub trait SemiRing: ComMonoid + Mul<Output=Self> + One {}
impl<T: ComMonoid + Mul<Output=Self> + One> SemiRing for T {}
/// 環
pub trait Ring: ComGroup + SemiRing {}
impl<T: ComGroup + SemiRing> Ring for T {}
pub trait ComRing: Ring + MulAssign {}
impl<T: Ring + MulAssign> ComRing for T {}
/// 体
pub trait Field: ComRing + Div<Output=Self> + DivAssign {}
impl<T: ComRing + Div<Output=Self> + DivAssign> Field for T {}
/// 加法単元
pub trait Zero: Element {
    fn zero() -> Self;
    fn is_zero(&self) -> bool {
        *self == Self::zero()
    }
}
/// 乗法単元
pub trait One: Element {
    fn one() -> Self;
    fn is_one(&self) -> bool {
        *self == Self::one()
    }
}
macro_rules! impl_integer {
    ($($T:ty,)*) => {
        $(
            impl Associative for $T {}
            impl Zero for $T {
                fn zero() -> Self { 0 }
                fn is_zero(&self) -> bool { *self == 0 }
            }
            impl<'a> Zero for &'a $T {
                fn zero() -> Self { &0 }
                fn is_zero(&self) -> bool { *self == &0 }
            }
            impl One for $T {
                fn one() -> Self { 1 }
                fn is_one(&self) -> bool { *self == 1 }
            }
            impl<'a> One for &'a $T {
                fn one() -> Self { &1 }
                fn is_one(&self) -> bool { *self == &1 }
            }
        )*
    };
}
impl_integer! {
    i8, i16, i32, i64, i128, isize,
    u8, u16, u32, u64, u128, usize,
}
// ------------ algebraic traits end ------------
// ------------ io module start ------------
use std::io::{stdout, BufWriter, Read, StdoutLock, Write};
pub struct IO {
    iter: std::str::SplitAsciiWhitespace<'static>,
    buf: BufWriter<StdoutLock<'static>>,
}
impl IO {
    pub fn new() -> Self {
        let mut input = String::new();
        std::io::stdin().read_to_string(&mut input).unwrap();
        let input = Box::leak(input.into_boxed_str());
        let out = Box::new(stdout());
        IO {
            iter: input.split_ascii_whitespace(),
            buf: BufWriter::new(Box::leak(out).lock()),
        }
    }
    fn scan_str(&mut self) -> &'static str {
        self.iter.next().unwrap()
    }
    pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output {
        <T as Scan>::scan(self)
    }
    pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> {
        (0..n).map(|_| self.scan::<T>()).collect()
    }
    pub fn print<T: Print>(&mut self, x: T) {
        <T as Print>::print(self, x);
    }
    pub fn println<T: Print>(&mut self, x: T) {
        self.print(x);
        self.print("\n");
    }
    pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) {
        if let Some(v) = iter.next() {
            self.print(v);
            for v in iter {
                self.print(delim);
                self.print(v);
            }
        }
        self.print("\n");
    }
    pub fn flush(&mut self) {
        self.buf.flush().unwrap();
    }
}
impl Default for IO {
    fn default() -> Self {
        Self::new()
    }
}
pub trait Scan {
    type Output;
    fn scan(io: &mut IO) -> Self::Output;
}
macro_rules! impl_scan {
    ($($t:tt),*) => {
        $(
            impl Scan for $t {
                type Output = Self;
                fn scan(s: &mut IO) -> Self::Output {
                    s.scan_str().parse().unwrap()
                }
            }
        )*
    };
}
impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String);
pub enum Bytes {}
impl Scan for Bytes {
    type Output = &'static [u8];
    fn scan(s: &mut IO) -> Self::Output {
        s.scan_str().as_bytes()
    }
}
pub enum Chars {}
impl Scan for Chars {
    type Output = Vec<char>;
    fn scan(s: &mut IO) -> Self::Output {
        s.scan_str().chars().collect()
    }
}
pub enum Usize1 {}
impl Scan for Usize1 {
    type Output = usize;
    fn scan(s: &mut IO) -> Self::Output {
        s.scan::<usize>().wrapping_sub(1)
    }
}
impl<T: Scan, U: Scan> Scan for (T, U) {
    type Output = (T::Output, U::Output);
    fn scan(s: &mut IO) -> Self::Output {
        (T::scan(s), U::scan(s))
    }
}
impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) {
    type Output = (T::Output, U::Output, V::Output);
    fn scan(s: &mut IO) -> Self::Output {
        (T::scan(s), U::scan(s), V::scan(s))
    }
}
impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) {
    type Output = (T::Output, U::Output, V::Output, W::Output);
    fn scan(s: &mut IO) -> Self::Output {
        (T::scan(s), U::scan(s), V::scan(s), W::scan(s))
    }
}
pub trait Print {
    fn print(w: &mut IO, x: Self);
}
macro_rules! impl_print_int {
    ($($t:ty),*) => {
        $(
            impl Print for $t {
                fn print(w: &mut IO, x: Self) {
                    w.buf.write_all(x.to_string().as_bytes()).unwrap();
                }
            }
        )*
    };
}
impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize);
impl Print for u8 {
    fn print(w: &mut IO, x: Self) {
        w.buf.write_all(&[x]).unwrap();
    }
}
impl Print for &[u8] {
    fn print(w: &mut IO, x: Self) {
        w.buf.write_all(x).unwrap();
    }
}
impl Print for &str {
    fn print(w: &mut IO, x: Self) {
        w.print(x.as_bytes());
    }
}
impl Print for String {
    fn print(w: &mut IO, x: Self) {
        w.print(x.as_bytes());
    }
}
impl<T: Print, U: Print> Print for (T, U) {
    fn print(w: &mut IO, (x, y): Self) {
        w.print(x);
        w.print(" ");
        w.print(y);
    }
}
impl<T: Print, U: Print, V: Print> Print for (T, U, V) {
    fn print(w: &mut IO, (x, y, z): Self) {
        w.print(x);
        w.print(" ");
        w.print(y);
        w.print(" ");
        w.print(z);
    }
}
mod neboccoio_macro {
    #[macro_export]
    macro_rules! input {
        (@start $io:tt @read @rest) => {};
        (@start $io:tt @read @rest, $($rest: tt)*) => {
            input!(@start $io @read @rest $($rest)*)
        };
        (@start $io:tt @read @rest mut $($rest:tt)*) => {
            input!(@start $io @read @mut [mut] @rest $($rest)*)
        };
        (@start $io:tt @read @rest $($rest:tt)*) => {
            input!(@start $io @read @mut [] @rest $($rest)*)
        };
        (@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:expr] $($rest:tt)*) => {
            let $($mut)* $var = $io.scan_vec::<$kind>($len);
            input!(@start $io @read @rest $($rest)*)
        };
        (@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => {
            let $($mut)* $var = $io.scan::<$kind>();
            input!(@start $io @read @rest $($rest)*)
        };
        (from $io:tt $($rest:tt)*) => {
            input!(@start $io @read @rest $($rest)*)
        };
    }
}
// ------------ io module end ------------
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0