#918716 (Rust) No.2495 Three Sets

• 問題: No.2495 Three Sets
• ユーザー: akakimidori
• 提出日時: 2023-10-06 23:00:07
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 235 ms / 3,000 ms
• コード長: 3,182 bytes
• コンパイル時間: 12,936 ms
• コンパイル使用メモリ: 383,228 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-26 16:52:22
• 合計ジャッジ時間: 17,606 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 18

ソースコード

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
fn main() {
    input! {
        x: usize,
        y: usize,
        z: usize,
        a: [i64; x],
        b: [i64; y],
        c: [i64; z],
    }
    let m = 3000;
    let mut memo = vec![vec![(0, 0); 2 * m + 1]; 3];
    for (memo, a) in memo.iter_mut().zip(vec![a, b, c]) {
        for a in a {
            let po = &mut memo[(a + m as i64) as usize];
            po.0 += 1;
            po.1 += a;
        }
        for i in (0..(2 * m)).rev() {
            memo[i].0 += memo[i + 1].0;
            memo[i].1 += memo[i + 1].1;
        }
    }
    let mut ans = 0i64;
    for a in memo[0].iter() {
        for b in memo[1].iter() {
            if a.0 == 0 {
                let val = a.1 * b.0;
                ans.chmax(val);
                ans.chmax(val + b.1 * z as i64);
                continue;
            }
            let key = if b.1 >= 0 {
                -(b.1 / a.0)
            } else {
                (-b.1 + a.0 - 1) / a.0
            };
            let c = if key < -(m as i64) {
                memo[2][0]
            } else {
                memo[2][(key + m as i64).min(2 * m as i64) as usize]
            };
            ans.chmax(a.1 * b.0 + b.1 * c.0 + c.1 * a.0);
        }
    }
    println!("{}", ans);
}
// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}
impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
// ---------- 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 ----------
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX