#711290 (Rust) No.1723 [Cherry 3rd Tune *] Dead on

• 問題: No.1723 [Cherry 3rd Tune *] Dead on
• ユーザー: Moss_Local
• 提出日時: 2021-10-29 21:41:20
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 7,251 bytes
• コンパイル時間: 14,245 ms
• コンパイル使用メモリ: 378,648 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-07 10:32:59
• 合計ジャッジ時間: 14,955 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	1 ms; 6,820 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	4 ms; 6,816 KB
testcase_09	AC	1 ms; 6,816 KB
testcase_10	AC	5 ms; 6,816 KB
testcase_11	AC	1 ms; 6,820 KB
testcase_12	AC	2 ms; 6,820 KB
testcase_13	AC	1 ms; 6,816 KB
testcase_14	AC	1 ms; 6,816 KB
testcase_15	AC	21 ms; 6,816 KB
testcase_16	AC	6 ms; 6,820 KB
testcase_17	AC	22 ms; 6,820 KB
testcase_18	AC	11 ms; 6,820 KB
testcase_19	WA	-
testcase_20	AC	3 ms; 6,816 KB
testcase_21	AC	11 ms; 6,820 KB
testcase_22	AC	4 ms; 6,816 KB
testcase_23	AC	6 ms; 6,816 KB
testcase_24	AC	1 ms; 6,816 KB
testcase_25	AC	11 ms; 6,816 KB
testcase_26	AC	4 ms; 6,816 KB
testcase_27	AC	1 ms; 6,816 KB
testcase_28	AC	13 ms; 6,820 KB
testcase_29	AC	11 ms; 6,820 KB
testcase_30	AC	21 ms; 6,816 KB
testcase_31	AC	10 ms; 6,816 KB
testcase_32	AC	4 ms; 6,816 KB
testcase_33	AC	1 ms; 6,816 KB
testcase_34	AC	1 ms; 6,820 KB
testcase_35	AC	0 ms; 6,816 KB
testcase_36	AC	30 ms; 6,820 KB
testcase_37	WA	-
testcase_38	AC	1 ms; 6,816 KB
testcase_39	AC	1 ms; 6,820 KB
testcase_40	AC	1 ms; 6,820 KB
testcase_41	AC	1 ms; 6,816 KB
testcase_42	WA	-
testcase_43	AC	1 ms; 6,816 KB
testcase_44	AC	1 ms; 6,816 KB
testcase_45	AC	1 ms; 6,820 KB
testcase_46	AC	1 ms; 6,816 KB
testcase_47	AC	1 ms; 6,816 KB
testcase_48	AC	1 ms; 6,816 KB
testcase_49	WA	-

コンパイルメッセージ

warning: unnecessary parentheses around type
   --> src/main.rs:114:15
    |
114 | fn readi() -> (i64) {
    |               ^   ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
114 - fn readi() -> (i64) {
114 + fn readi() -> i64 {
    |

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::arch::x86_64::_XCR_XFEATURE_ENABLED_MASK;
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::f64::consts::PI;
use std::fmt::Debug;
use std::fmt::Display;
use std::fs::File;
use std::hash::Hash;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
// const FINF: f64 = 122337203685.0;
const LINF: i64 = 2147483647;
const FINF: f64 = LINF as f64;
const INF128: i128 = 1223372036854775807000000000000;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;

const MPI: f64 = 3.14159265358979323846264338327950288f64;
// const MOD: i64 = INF;

const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}

macro_rules! chmin {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_min = min!($($cmps),+);
        if $base > cmp_min {
            $base = cmp_min;
            true
        } else {
            false
        }
    }};
}

macro_rules! chmax {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_max = max!($($cmps),+);
        if $base < cmp_max {
            $base = cmp_max;
            true
        } else {
            false
        }
    }};
}

macro_rules! min {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::min($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::min($a, min!($($rest),+))
    }};
}

macro_rules! max {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::max($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::max($a, max!($($rest),+))
    }};
}

// use str::Chars;

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

/// Equivalent to std::lowerbound and std::upperbound in c++

fn prime_factorization(x: usize) -> BTreeMap<u128, u128> {
    let mut res: BTreeMap<u128, u128> = BTreeMap::new();
    let mut xx = x as u128;
    let mut p: u128 = 2;
    while p * p <= xx {
        while xx % p == 0 {
            // println!("{:?}", p);
            let t = res.get_mut(&p);
            if t.is_none() {
                res.insert(p, 1);
            } else {
                *t.unwrap() += 1;
            }
            xx /= p;
        }
        // println!("{:?} {:?}", p, res);
        p += 1;
    }

    if xx != 1 {
        let t = res.get_mut(&xx);
        if t.is_none() {
            res.insert(xx, 1);
        } else {
            *t.unwrap() += 1;
        }
    }
    res
}

fn solve() {
    let (x, a, y, b) = readuuuu();
    let a = a as u128;
    let b = b as u128;
    if x == 1 {
        p!("Yes");
        return;
    }
    if y == 1 {
        p!("No");
        return;
    }
    let mut pf1 = prime_factorization(x);
    for i in pf1.clone().iter() {
        pf1.insert(*i.0, i.1 * a);
    }
    let mut pf2 = prime_factorization(x);
    for i in pf2.clone().iter() {
        pf2.insert(*i.0, i.1 * b);
    }
    // d!(pf1.clone());
    // d!(pf2.clone());
    for i in pf1 {
        if pf2.contains_key(&i.0) {
            let j = *pf2.get(&i.0).unwrap();
            if j > i.1 {
                p!("No");
                return;
            }
        } else {
            p!("No");
            return;
        }
    }
    p!("Yes");
    return;
}
fn main() {
    solve();
}