#977993 (Rust) No.2741 Balanced Choice

• 問題: No.2741 Balanced Choice
• ユーザー: Yukino DX.
• 提出日時: 2024-04-29 17:25:36
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 242 ms / 2,000 ms
• コード長: 3,318 bytes
• コンパイル時間: 13,182 ms
• コンパイル使用メモリ: 378,396 KB
• 実行使用メモリ: 198,016 KB
• 最終ジャッジ日時: 2024-11-18 23:07:58
• 合計ジャッジ時間: 16,505 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 10

ソースコード

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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#![allow(unused_imports)]
//use itertools::{iproduct, Itertools};
use proconio::input;
use proconio::marker::*;
use std::collections::*;
fn main() {
    input! {
        n:usize,
        w:usize,
        d:usize,
        twvs:[(usize,usize,i64);n],
    }
    let twv = [
        twvs.iter()
            .filter(|(t, _, _)| *t == 0)
            .copied()
            .collect::<Vec<_>>(),
        twvs.iter()
            .filter(|(t, _, _)| *t == 1)
            .copied()
            .collect::<Vec<_>>(),
    ];
    const INF: i64 = std::i64::MAX;
    let mut dp = [
        vec![vec![-INF; w + 1]; twv[0].len() + 1],
        vec![vec![-INF; w + 1]; twv[1].len() + 1],
    ];
    dp[0][0][0] = 0;
    dp[1][0][0] = 0;
    for k in 0..2 {
        for i in 0..twv[k].len() {
            for j in 0..=w {
                if dp[k][i][j] == -INF {
                    continue;
                }
                dp[k][i + 1][j] = dp[k][i + 1][j].max(dp[k][i][j]);
                if j + twv[k][i].1 <= w {
                    dp[k][i + 1][j + twv[k][i].1] =
                        dp[k][i + 1][j + twv[k][i].1].max(dp[k][i][j] + twv[k][i].2);
                }
            }
        }
    }
    let mut seg = SegmentTree::new(w + 1, |a, b| a.max(b), |_, new| new, -INF);
    for i in 0..=w {
        seg.update(i, dp[1][twv[1].len()][i]);
    }
    let mut ans = 0;
    for i in 0..=w {
        if dp[0][twv[0].len()][i] == -INF {
            continue;
        }
        let left = i.saturating_sub(d);
        let right = (w - i).min(i + d);
        if left > right {
            continue;
        }
        let score = dp[0][twv[0].len()][i] + seg.query(left, right + 1);
        ans = ans.max(score);
    }
    println!("{}", ans);
}
use segmenttree::*;
mod segmenttree {
    pub struct SegmentTree<T, F: Fn(T, T) -> T, G: Fn(T, T) -> T> {
        n: usize,
        merge: F,
        replace: G,
        unit: T,
        tree: Vec<T>,
    }
    impl<T, F, G> SegmentTree<T, F, G>
    where
        T: Copy,
        F: Fn(T, T) -> T,
        G: Fn(T, T) -> T,
    {
        pub fn new(len: usize, merge: F, replace: G, unit: T) -> Self {
            let mut n = 1;
            while n < len {
                n *= 2;
            }
            Self {
                n,
                merge,
                replace,
                unit,
                tree: vec![unit; 2 * n],
            }
        }
        //0index
        pub fn update(&mut self, mut i: usize, x: T) {
            i += self.n - 1;
            self.tree[i] = (self.replace)(self.tree[i], x);
            while i > 0 {
                i = (i - 1) / 2;
                self.tree[i] = (self.merge)(self.tree[2 * i + 1], self.tree[2 * i + 2]);
            }
        }
        //[l,r)
        pub fn query(&self, l: usize, r: usize) -> T {
            self._query(l, r, 0, 0, self.n)
        }
        fn _query(&self, l: usize, r: usize, i: usize, a: usize, b: usize) -> T {
            if r <= a || b <= l {
                return self.unit;
            }
            if l <= a && b <= r {
                return self.tree[i];
            }
            let res0 = self._query(l, r, 2 * i + 1, a, (a + b) / 2);
            let res1 = self._query(l, r, 2 * i + 2, (a + b) / 2, b);
            (self.merge)(res0, res1)
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX