#889727 (Rust) No.2039 Copy and Avoid

• 問題: No.2039 Copy and Avoid
• ユーザー: koba-e964
• 提出日時: 2023-07-11 11:03:13
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 1,869 bytes
• コンパイル時間: 12,500 ms
• コンパイル使用メモリ: 396,488 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-13 02:01:21
• 合計ジャッジ時間: 14,145 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
other	AC * 31

ソースコード

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
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"));
}
fn main() {
    input! {
        n: i64, m: usize, a: i64, b: i64,
        c: [i64; m],
    }
    let mut div = vec![];
    {
        let mut d = 1;
        while d * d <= n {
            if n % d == 0 {
                div.push(d);
                if n != d * d {
                    div.push(n / d);
                }
            }
            d += 1;
        }
        div.sort();
    }
    let k = div.len();
    const INF: i64 = 1 << 60;
    let mut dp = vec![INF; k];
    dp[0] = 0;
    for i in 0..k {
        let mut lim = INF;
        for &v in &c {
            if v % div[i] == 0 {
                lim = min(lim, v);
            }
        }
        for j in i + 1..k {
            if div[j] < lim && div[j] % div[i] == 0 {
                dp[j] = min(dp[j], dp[i] + (div[j] / div[i] - 1) * a + b);
            }
        }
    }
    println!("{}", if dp[k - 1] >= INF { -1 } else { dp[k - 1] - b });
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX