結果

問題 No.1330 Multiply or Divide
ユーザー Strorkis
提出日時 2021-01-09 11:05:56
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 3,628 bytes
コンパイル時間 16,418 ms
コンパイル使用メモリ 387,652 KB
実行使用メモリ 9,408 KB
最終ジャッジ日時 2024-11-17 13:11:21
合計ジャッジ時間 19,160 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused return value of `std::cmp::Ord::max` that must be used
   --> src/main.rs:100:9
    |
100 |         max_a.max(a);
    |         ^^^^^^^^^^^^
    |
    = note: `#[warn(unused_must_use)]` on by default
help: use `let _ = ...` to ignore the resulting value
    |
100 |         let _ = max_a.max(a);
    |         +++++++

ソースコード

diff #
プレゼンテーションモードにする

struct Scanner<R> { r: R, buf: Vec<u8> }
impl<R: std::io::BufRead> Scanner<R> {
    fn new(r: R) -> Scanner<R> {
        Scanner { r, buf: Vec::with_capacity(8000) }
    }
    fn next(&mut self) -> &str {
        self.buf.clear();
        loop {
            let (done, used) = {
                let available = self.r.fill_buf().unwrap();
                match available.iter().position(|b| !b.is_ascii_whitespace()) {
                    Some(i) => (true, i),
                    None => (false, available.len()),
                }
            };
            self.r.consume(used);
            if done || used == 0 { break; }
        }
        loop {
            let (done, used) = {
                let available = self.r.fill_buf().unwrap();
                match available.iter().position(|b| b.is_ascii_whitespace()) {
                    Some(i) => {
                        self.buf.extend_from_slice(&available[..i]);
                        (true, i)
                    }
                    None => {
                        self.buf.extend_from_slice(&available);
                        (false, available.len())
                    }
                }
            };
            self.r.consume(used);
            if done || used == 0 {
                unsafe {
                    return std::str::from_utf8_unchecked(&self.buf);
                }
            }
        }
    }
}
macro_rules! parse {
    ($s:expr, Chars) => ($s.chars().collect::<Vec<_>>());
    ($s:expr, Bytes) => ($s.bytes().collect::<Vec<_>>());
    ($s:expr, Usize1) => (parse!($s, usize) - 1);
    ($s:expr, $t:ty) => ($s.parse::<$t>().unwrap());
}
macro_rules! read {
    ($sc:expr, [$t:tt; $n:expr]) => (
        (0..$n).map(|_| read!($sc, $t)).collect::<Vec<_>>()
    );
    ($sc:expr, ($($t:tt),*)) => (($(read!($sc, $t)),*));
    ($sc:expr, $t:ident) => (parse!($sc.next(), $t));
    ($sc:expr, $($t:tt),*) => (($(read!($sc, $t)),*));
}
fn main() {
    use std::io::Write;
    let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
    let mut sc = Scanner::new(stdin.lock());
    let mut wr = std::io::BufWriter::new(stdout.lock());
    macro_rules! scan {
        ($($t:tt)*) => (read!(sc, $($t)*));
    }
    macro_rules! println {
        ($($arg:tt)*) => (writeln!(wr, $($arg)*).ok());
    }
    let (n, m, p) = scan!(usize, usize, usize);
    let a = scan!([usize; n]);
    let max_a = a.iter().max().unwrap();
    if m < *max_a {
        println!("1");
        return;
    }
    let m = m / max_a;
    let mut b = Vec::with_capacity(n);
    for mut a in a {
        let mut c = 1;
        while a % p == 0 {
            a /= p;
            c += 1;
        }
        if a == 1 { continue; }
        b.push((c, a));
    }
    b.sort_by_key(|key| (std::cmp::Reverse(key.0), key.1));
    let mut v = Vec::new();
    let max_a = 0;
    for (c, a) in b {
        if a <= max_a { continue; }
        v.push((c, a));
        max_a.max(a);
    }
    let mut ans = std::usize::MAX;
    let mut map = std::collections::BTreeMap::new();
    map.insert(0usize, 1);
    for cost in 0.. {
        if let Some(&x) = map.get(&cost) {
            for (c, a) in &v {
                let next_cost = cost + c;
                let next_x = x * a;
                if next_x > m {
                    ans = ans.min(next_cost + 1);
                } else {
                    let value = map.entry(next_cost).or_default();
                    *value = std::cmp::max(*value, next_x);
                }
            }
            map.remove(&cost);
            if map.is_empty() { break; }
        }
    }
    println!("{}", ans as isize);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0