結果

問題 No.1931 Fraction 2
ユーザー akakimidoriakakimidori
提出日時 2022-05-06 23:30:16
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 389 ms / 2,000 ms
コード長 11,591 bytes
コンパイル時間 15,344 ms
コンパイル使用メモリ 389,360 KB
実行使用メモリ 20,224 KB
最終ジャッジ日時 2024-07-06 17:25:06
合計ジャッジ時間 22,659 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 10 ms
8,960 KB
testcase_04 AC 9 ms
9,088 KB
testcase_05 AC 9 ms
8,832 KB
testcase_06 AC 10 ms
8,960 KB
testcase_07 AC 9 ms
8,924 KB
testcase_08 AC 9 ms
8,516 KB
testcase_09 AC 10 ms
8,792 KB
testcase_10 AC 7 ms
8,204 KB
testcase_11 AC 9 ms
8,832 KB
testcase_12 AC 8 ms
8,448 KB
testcase_13 AC 69 ms
12,160 KB
testcase_14 AC 229 ms
16,760 KB
testcase_15 AC 104 ms
13,084 KB
testcase_16 AC 26 ms
10,496 KB
testcase_17 AC 34 ms
10,880 KB
testcase_18 AC 303 ms
19,328 KB
testcase_19 AC 308 ms
19,328 KB
testcase_20 AC 304 ms
19,420 KB
testcase_21 AC 303 ms
19,456 KB
testcase_22 AC 303 ms
19,328 KB
testcase_23 AC 307 ms
19,452 KB
testcase_24 AC 306 ms
19,584 KB
testcase_25 AC 312 ms
19,292 KB
testcase_26 AC 308 ms
19,312 KB
testcase_27 AC 306 ms
19,328 KB
testcase_28 AC 378 ms
19,968 KB
testcase_29 AC 382 ms
20,144 KB
testcase_30 AC 389 ms
20,096 KB
testcase_31 AC 380 ms
20,064 KB
testcase_32 AC 379 ms
20,224 KB
testcase_33 AC 381 ms
20,096 KB
testcase_34 AC 379 ms
20,096 KB
testcase_35 AC 381 ms
20,220 KB
testcase_36 AC 380 ms
20,096 KB
testcase_37 AC 379 ms
20,080 KB
testcase_38 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

fn run() {
    input! {
        n: usize,
        p: [(usize, usize); n],
    }
    let m = p.iter().map(|p| p.0.max(p.1)).max().unwrap();
    let mut f = (0..=m).collect::<Vec<_>>();
    for i in (2..).take_while(|k| k * k <= m) {
        if i == f[i] {
            for j in i..=(m / i) {
                f[j * i] = i;
            }
        }
    }
    let factor = f;
    let factorize = |mut n: usize, res: &mut Vec<(usize, usize)>| {
        res.clear();
        while n > 1 {
            let p = factor[n];
            let mut cnt = 0;
            while n % p == 0 {
                n /= p;
                cnt += 1;
            }
            res.push((p, cnt));
        }
    };
    let mut index = vec![vec![]; m + 1];
    let mut factor = vec![];
    for (i, &(_, b)) in p.iter().enumerate() {
        factorize(b, &mut factor);
        for (p, _) in factor.drain(..) {
            index[p].push(i);
        }
    }
    let mut divide = M::one();
    let mut cnt = InitArray::new(0usize, m + 1);
    for (prime, index) in index.into_iter().enumerate().filter(|p| !p.1.is_empty()) {
        cnt.init();
        for &x in index.iter() {
            factorize(p[x].1, &mut factor);
            for (p, c) in factor.drain(..) {
                cnt[p] = cnt[p].max(c);
            }
        }
        let cnt = &cnt;
        let mut pow = 1;
        for _ in 0..cnt[prime] {
            pow *= prime;
        }
        let pow = pow;
        let mut lcm = 1;
        for p in cnt.list.iter() {
            let p = *p as usize;
            if p != prime {
                for _ in 0..cnt[p] {
                    lcm = lcm * p % pow;
                }
            }
        }
        let mut sum = 0;
        for &x in index.iter() {
            let mut b = p[x].1;
            let mut geta = pow;
            while b % prime == 0 {
                b /= prime;
                geta /= prime;
            }
            sum = (sum + p[x].0 * geta % pow * lcm % pow * inv(b % pow, pow)) % pow;
        }
        let mut m = pow;
        while m % prime == 0 && sum % prime == 0 {
            divide *= M::from(prime);
            m /= prime;
            sum /= prime;
        }
    }
    let mut cnt = vec![0; m + 1];
    for b in p.iter().map(|p| p.1) {
        factorize(b, &mut factor);
        for (p, c) in factor.drain(..) {
            cnt[p] = cnt[p].max(c);
        }
    }
    let mut de = M::one();
    for (i, cnt) in cnt.iter().enumerate() {
        if *cnt > 0 {
            de *= M::from(i).pow(*cnt as u64);
        }
    }
    let mut nu = M::zero();
    for &(a, b) in p.iter() {
        nu += M::from(a) * de * M::from(b).inv();
    }
    nu *= divide.inv();
    de *= divide.inv();
    println!("{} {}", nu, de);
}

fn inv(a: usize, b: usize) -> usize {
    assert!(a < b);
    let res = if a == 1 {
        1
    } else {
        (b * a - b * inv(b % a, a) + 1) / a % b
    };
    assert!(res < b && res * a % b == 1);
    res
}

fn main() {
    run();
}

// ---------- 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 ----------
// ---------- begin modint ----------
use std::marker::*;
use std::ops::*;

pub trait Modulo {
    fn modulo() -> u32;
}

pub struct ConstantModulo<const M: u32>;

impl<const M: u32> Modulo for ConstantModulo<{ M }> {
    fn modulo() -> u32 {
        M
    }
}

pub struct ModInt<T>(u32, PhantomData<T>);

impl<T> Clone for ModInt<T> {
    fn clone(&self) -> Self {
        Self::new_unchecked(self.0)
    }
}

impl<T> Copy for ModInt<T> {}

impl<T: Modulo> Add for ModInt<T> {
    type Output = ModInt<T>;
    fn add(self, rhs: Self) -> Self::Output {
        let mut v = self.0 + rhs.0;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        Self::new_unchecked(v)
    }
}

impl<T: Modulo> AddAssign for ModInt<T> {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}

impl<T: Modulo> Sub for ModInt<T> {
    type Output = ModInt<T>;
    fn sub(self, rhs: Self) -> Self::Output {
        let mut v = self.0 - rhs.0;
        if self.0 < rhs.0 {
            v += T::modulo();
        }
        Self::new_unchecked(v)
    }
}

impl<T: Modulo> SubAssign for ModInt<T> {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}

impl<T: Modulo> Mul for ModInt<T> {
    type Output = ModInt<T>;
    fn mul(self, rhs: Self) -> Self::Output {
        let v = self.0 as u64 * rhs.0 as u64 % T::modulo() as u64;
        Self::new_unchecked(v as u32)
    }
}

impl<T: Modulo> MulAssign for ModInt<T> {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}

impl<T: Modulo> Neg for ModInt<T> {
    type Output = ModInt<T>;
    fn neg(self) -> Self::Output {
        if self.is_zero() {
            Self::zero()
        } else {
            Self::new_unchecked(T::modulo() - self.0)
        }
    }
}

impl<T> std::fmt::Display for ModInt<T> {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl<T> std::fmt::Debug for ModInt<T> {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl<T> Default for ModInt<T> {
    fn default() -> Self {
        Self::zero()
    }
}

impl<T: Modulo> std::str::FromStr for ModInt<T> {
    type Err = std::num::ParseIntError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let val = s.parse::<u32>()?;
        Ok(ModInt::new(val))
    }
}

impl<T: Modulo> From<usize> for ModInt<T> {
    fn from(val: usize) -> ModInt<T> {
        ModInt::new_unchecked((val % T::modulo() as usize) as u32)
    }
}

impl<T: Modulo> From<u64> for ModInt<T> {
    fn from(val: u64) -> ModInt<T> {
        ModInt::new_unchecked((val % T::modulo() as u64) as u32)
    }
}

impl<T: Modulo> From<i64> for ModInt<T> {
    fn from(val: i64) -> ModInt<T> {
        let mut v = ((val % T::modulo() as i64) + T::modulo() as i64) as u32;
        if v >= T::modulo() {
            v -= T::modulo();
        }
        ModInt::new_unchecked(v)
    }
}

impl<T> ModInt<T> {
    pub fn new_unchecked(n: u32) -> Self {
        ModInt(n, PhantomData)
    }
    pub fn zero() -> Self {
        ModInt::new_unchecked(0)
    }
    pub fn one() -> Self {
        ModInt::new_unchecked(1)
    }
    pub fn is_zero(&self) -> bool {
        self.0 == 0
    }
}

impl<T: Modulo> ModInt<T> {
    pub fn new(d: u32) -> Self {
        ModInt::new_unchecked(d % T::modulo())
    }
    pub fn pow(&self, mut n: u64) -> Self {
        let mut t = Self::one();
        let mut s = *self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(&self) -> Self {
        assert!(!self.is_zero());
        self.pow(T::modulo() as u64 - 2)
    }
    pub fn fact(n: usize) -> Self {
        (1..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn perm(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        ((n - k + 1)..=n).fold(Self::one(), |s, a| s * Self::from(a))
    }
    pub fn binom(n: usize, k: usize) -> Self {
        if k > n {
            return Self::zero();
        }
        let k = k.min(n - k);
        let mut nu = Self::one();
        let mut de = Self::one();
        for i in 0..k {
            nu *= Self::from(n - i);
            de *= Self::from(i + 1);
        }
        nu * de.inv()
    }
}
// ---------- end modint ----------
// ---------- begin precalc ----------
pub struct Precalc<T> {
    fact: Vec<ModInt<T>>,
    ifact: Vec<ModInt<T>>,
    inv: Vec<ModInt<T>>,
}

impl<T: Modulo> Precalc<T> {
    pub fn new(n: usize) -> Precalc<T> {
        let mut inv = vec![ModInt::one(); n + 1];
        let mut fact = vec![ModInt::one(); n + 1];
        let mut ifact = vec![ModInt::one(); n + 1];
        for i in 2..=n {
            fact[i] = fact[i - 1] * ModInt::new_unchecked(i as u32);
        }
        ifact[n] = fact[n].inv();
        if n > 0 {
            inv[n] = ifact[n] * fact[n - 1];
        }
        for i in (1..n).rev() {
            ifact[i] = ifact[i + 1] * ModInt::new_unchecked((i + 1) as u32);
            inv[i] = ifact[i] * fact[i - 1];
        }
        Precalc { fact, ifact, inv }
    }
    pub fn inv(&self, n: usize) -> ModInt<T> {
        assert!(n > 0);
        self.inv[n]
    }
    pub fn fact(&self, n: usize) -> ModInt<T> {
        self.fact[n]
    }
    pub fn ifact(&self, n: usize) -> ModInt<T> {
        self.ifact[n]
    }
    pub fn perm(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[n - k]
    }
    pub fn binom(&self, n: usize, k: usize) -> ModInt<T> {
        if k > n {
            return ModInt::zero();
        }
        self.fact[n] * self.ifact[k] * self.ifact[n - k]
    }
}
// ---------- end precalc ----------

type M = ModInt<ConstantModulo<998_244_353>>;

// ---------- begin init array ----------
#[derive(Clone)]
pub struct InitArray<T> {
    data: Vec<T>,
    used: Vec<bool>,
    list: Vec<u32>,
    zero: T,
}

impl<T: Copy> InitArray<T> {
    pub fn new(zero: T, size: usize) -> Self {
        InitArray {
            data: vec![zero; size],
            used: vec![false; size],
            list: vec![],
            zero: zero,
        }
    }
    pub fn init(&mut self) {
        self.init_with(|_, _| ());
    }
    pub fn init_with<F>(&mut self, mut f: F)
    where
        F: FnMut(usize, T),
    {
        for x in self.list.drain(..) {
            let x = x as usize;
            self.used[x] = false;
            let v = std::mem::replace(&mut self.data[x], self.zero);
            f(x, v);
        }
    }
}

impl<T> std::ops::Index<usize> for InitArray<T> {
    type Output = T;
    fn index(&self, pos: usize) -> &Self::Output {
        &self.data[pos]
    }
}

impl<T> std::ops::IndexMut<usize> for InitArray<T> {
    fn index_mut(&mut self, pos: usize) -> &mut Self::Output {
        if !self.used[pos] {
            self.used[pos] = true;
            self.list.push(pos as u32);
        }
        &mut self.data[pos]
    }
}
// ---------- end init array ----------
0