#600692 (Rust) No.1330 Multiply or Divide

• 問題: No.1330 Multiply or Divide
• ユーザー: akakimidori
• 提出日時: 2021-01-08 21:43:49
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 52 ms / 2,000 ms
• コード長: 3,050 bytes
• コンパイル時間: 13,951 ms
• コンパイル使用メモリ: 378,048 KB
• 実行使用メモリ: 5,632 KB
• 最終ジャッジ日時: 2024-11-16 19:18:20
• 合計ジャッジ時間: 16,110 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

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

ソースコード

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
// ---------- begin chmin, chmax ----------
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_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_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_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 ----------
use std::cmp::*;
fn run() {
    input! {
        n: usize,
        m: u64,
        p: u64,
        a: [u64; n],
    }
    let mut map = std::collections::BTreeMap::new();
    for a in a.iter() {
        let mut b = *a;
        let mut cost = 1;
        while b % p == 0 {
            b /= p;
            cost += 1;
        }
        map.entry(cost).or_insert((a, b)).chmax((a, b));
    }
    let mut dp = std::collections::BTreeMap::new();
    dp.insert(m, 0);
    let mut h = std::collections::BinaryHeap::new();
    h.push(Reverse((0, m)));
    let mut ans = 10000;
    while let Some(Reverse((d, v))) = h.pop() {
        if *dp.get(&v).unwrap() < d {
            continue;
        }
        for (&cost, &(a, b)) in map.iter() {
            if v / a == 0 {
                ans.chmin(d + 1);
            } else {
                let u = v / b;
                let d = d + cost;
                if dp.entry(u).or_insert(10000).chmin(d) {
                    h.push(Reverse((d, u)));
                }
            }
        }
    }
    if ans < 10000 {
        println!("{}", ans);
    } else {
        println!("-1");
    }
}
fn main() {
    run();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX