#975922 (Rust) No.2741 Balanced Choice

• 問題: No.2741 Balanced Choice
• ユーザー: tipstar0125
• 提出日時: 2024-04-20 23:55:06
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 308 ms / 2,000 ms
• コード長: 2,594 bytes
• コンパイル時間: 14,073 ms
• コンパイル使用メモリ: 400,056 KB
• 実行使用メモリ: 197,888 KB
• 最終ジャッジ日時: 2024-10-12 22:13:27
• 合計ジャッジ時間: 17,701 ms
• ジャッジサーバーID （参考情報）: judge2 / 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
#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::needless_range_loop)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
#![allow(dead_code)]
// use itertools::Itertools;
use std::cmp::Reverse;
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, VecDeque};
// use superslice::Ext;
// use bitset_fixed::BitSet;
use proconio::{
    input,
    marker::{Chars, Usize1},
};
#[derive(Default)]
struct Solver {}
impl Solver {
    // #[fastout]
    fn solve(&mut self) {
        input! {
            N: usize,
            W: usize,
            D: isize,
            TWV: [(usize, usize, isize); N]
        }
        let mut WV0 = vec![];
        let mut WV1 = vec![];
        for &(t, w, v) in TWV.iter() {
            if t == 0 {
                WV0.push((w, v));
            } else {
                WV1.push((w, v));
            }
        }
        let L0 = WV0.len();
        let L1 = WV1.len();
        let INF = 1_isize << 60;
        let mut dp0 = vec![vec![-INF; W + 1]; L0 + 1];
        let mut dp1 = vec![vec![-INF; W + 1]; L1 + 1];
        dp0[0][0] = 0;
        dp1[0][0] = 0;
        for i in 1..=L0 {
            let (w, v) = WV0[i - 1];
            for j in 0..=W {
                dp0[i][j] = max!(dp0[i][j], dp0[i - 1][j]);
                if j + w <= W {
                    dp0[i][j + w] = max!(dp0[i][j + w], dp0[i - 1][j] + v);
                }
            }
        }
        for i in 1..=L1 {
            let (w, v) = WV1[i - 1];
            for j in 0..=W {
                dp1[i][j] = max!(dp1[i][j], dp1[i - 1][j]);
                if j + w <= W {
                    dp1[i][j + w] = max!(dp1[i][j + w], dp1[i - 1][j] + v);
                }
            }
        }
        let mut ans = 0;
        for i in 0..=W {
            for j in 0..=W {
                if (i as isize - j as isize).abs() > D || i + j > W {
                    continue;
                }
                ans = max!(ans, dp0[L0][i] + dp1[L1][j]);
            }
        }
        println!("{}", ans);
    }
}
#[macro_export]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::max($x, max!($( $y ),+))
    }
}
#[macro_export]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::min($x, min!($( $y ),+))
    }
}
fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| Solver::default().solve())
        .unwrap()
        .join()
        .unwrap();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX