#704431 (Rust) No.1117 数列分割

• 問題: No.1117 数列分割
• ユーザー: koba-e964
• 提出日時: 2021-10-03 15:31:57
• 言語: Rust (1.83.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 2,208 bytes
• コンパイル時間: 16,612 ms
• コンパイル使用メモリ: 378,440 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-21 09:43:21
• 合計ジャッジ時間: 22,784 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 22 WA * 4

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#[allow(unused_imports)]
use std::cmp::*;
// 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 ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}
fn calc(n: usize, acc: &[i64], m: usize, x: i64) -> (i64, usize) {
    let mut dp = vec![(0, 0); n + 1];
    for i in 1..n + 1 {
        let mut me = (dp[i - 1].0 + acc[i] - acc[i - 1] - x, dp[i - 1].1 + 1);
        for j in 1..min(i, m) + 1 {
            me.chmax((dp[i - j].0 + (acc[i] - acc[i - j]).abs() - x, dp[i - j].1 + 1));
        }
        dp[i] = me;
    }
    dp[n]
}
fn main() {
    input! {
        n: usize, k: usize, m: usize,
        a: [i64; n],
    }
    let mut acc = vec![0; n + 1];
    for i in 0..n {
        acc[i + 1] = acc[i] + a[i];
    }
    let mut fail = 3i64 << 40;
    let mut pass = 0;
    while fail - pass > 1 {
        let mid = (fail + pass) / 2;
        let val = calc(n, &acc, m, mid);
        if val.1 >= k {
            pass = mid;
        } else {
            fail = mid;
        }
    }
    eprintln!("pass = {:?}", pass);
    let val = calc(n, &acc, m, pass);
    eprintln!("val = {:?}", val);
    println!("{}", val.0 + pass * k as i64);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX