結果

問題 No.2207 pCr検査
ユーザー koba-e964koba-e964
提出日時 2023-03-23 20:53:33
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 272 ms / 3,000 ms
コード長 6,681 bytes
コンパイル時間 12,565 ms
コンパイル使用メモリ 390,612 KB
実行使用メモリ 165,376 KB
最終ジャッジ日時 2024-09-18 15:35:56
合計ジャッジ時間 20,690 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 242 ms
158,804 KB
testcase_03 AC 134 ms
90,240 KB
testcase_04 AC 185 ms
118,784 KB
testcase_05 AC 237 ms
150,912 KB
testcase_06 AC 184 ms
140,032 KB
testcase_07 AC 123 ms
88,552 KB
testcase_08 AC 75 ms
50,408 KB
testcase_09 AC 177 ms
118,272 KB
testcase_10 AC 102 ms
86,256 KB
testcase_11 AC 171 ms
114,896 KB
testcase_12 AC 193 ms
134,072 KB
testcase_13 AC 115 ms
80,120 KB
testcase_14 AC 32 ms
21,416 KB
testcase_15 AC 222 ms
154,752 KB
testcase_16 AC 107 ms
71,680 KB
testcase_17 AC 172 ms
123,112 KB
testcase_18 AC 124 ms
96,512 KB
testcase_19 AC 73 ms
49,408 KB
testcase_20 AC 99 ms
76,392 KB
testcase_21 AC 250 ms
160,016 KB
testcase_22 AC 97 ms
12,288 KB
testcase_23 AC 96 ms
12,160 KB
testcase_24 AC 36 ms
28,128 KB
testcase_25 AC 101 ms
69,572 KB
testcase_26 AC 88 ms
64,108 KB
testcase_27 AC 162 ms
123,904 KB
testcase_28 AC 268 ms
165,376 KB
testcase_29 AC 270 ms
165,220 KB
testcase_30 AC 269 ms
165,168 KB
testcase_31 AC 272 ms
165,020 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
mod mod_int {
    use std::ops::*;
    pub trait Mod: Copy { fn m() -> i64; }
    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
    impl<M: Mod> ModInt<M> {
        // x >= 0
        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
        fn new_internal(x: i64) -> Self {
            ModInt { x: x, phantom: ::std::marker::PhantomData }
        }
        pub fn pow(self, mut e: i64) -> Self {
            debug_assert!(e >= 0);
            let mut sum = ModInt::new_internal(1);
            let mut cur = self;
            while e > 0 {
                if e % 2 != 0 { sum *= cur; }
                cur *= cur;
                e /= 2;
            }
            sum
        }
        #[allow(dead_code)]
        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
    }
    impl<M: Mod> Default for ModInt<M> {
        fn default() -> Self { Self::new_internal(0) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x + other.x;
            if sum >= M::m() { sum -= M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let other = other.into();
            let mut sum = self.x - other.x;
            if sum < 0 { sum += M::m(); }
            ModInt::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
    }
    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
        fn add_assign(&mut self, other: T) { *self = *self + other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
        fn sub_assign(&mut self, other: T) { *self = *self - other; }
    }
    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
        fn mul_assign(&mut self, other: T) { *self = *self * other; }
    }
    impl<M: Mod> Neg for ModInt<M> {
        type Output = Self;
        fn neg(self) -> Self { ModInt::new(0) - self }
    }
    impl<M> ::std::fmt::Display for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            let (mut a, mut b, _) = red(self.x, M::m());
            if b < 0 {
                a = -a;
                b = -b;
            }
            write!(f, "{}/{}", a, b)
        }
    }
    impl<M: Mod> From<i64> for ModInt<M> {
        fn from(x: i64) -> Self { Self::new(x) }
    }
    // Finds the simplest fraction x/y congruent to r mod p.
    // The return value (x, y, z) satisfies x = y * r + z * p.
    fn red(r: i64, p: i64) -> (i64, i64, i64) {
        if r.abs() <= 10000 {
            return (r, 1, 0);
        }
        let mut nxt_r = p % r;
        let mut q = p / r;
        if 2 * nxt_r >= r {
            nxt_r -= r;
            q += 1;
        }
        if 2 * nxt_r <= -r {
            nxt_r += r;
            q -= 1;
        }
        let (x, z, y) = red(nxt_r, r);
        (x, y - q * z, z)
    }
} // mod mod_int

macro_rules! define_mod {
    ($struct_name: ident, $modulo: expr) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
        struct $struct_name {}
        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
    }
}
const MOD: i64 = 1_000_000_007;
define_mod!(P, MOD);
type MInt = mod_int::ModInt<P>;

// Depends on MInt.rs
fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
    let mut fac = vec![MInt::new(1); w];
    let mut invfac = vec![0.into(); w];
    for i in 1..w {
        fac[i] = fac[i - 1] * i as i64;
    }
    invfac[w - 1] = fac[w - 1].inv();
    for i in (0..w - 1).rev() {
        invfac[i] = invfac[i + 1] * (i as i64 + 1);
    }
    (fac, invfac)
}

// ord_p(n!)
fn exp(p: i64, mut n: i64) -> i64 {
    let mut s = 0;
    while n > 0 {
        n /= p;
        s += n;
    }
    s
}

fn calc(pe: &[(i64, i64)]) -> Option<(i64, i64)> {
    let k = pe.len();
    let p = pe[k - 1].0;
    let pp = p as usize;
    if pe[k - 1].1 != 1 {
        return None;
    }
    let (fac, invfac) = fact_init(pp + 1);
    let mut cor = MInt::new(1);
    for &(p, e) in pe {
        cor *= MInt::new(p).pow(e);
    }
    let mut cand = vec![];
    for r in 1..=pp / 2 {
        let tmp = fac[pp] * invfac[r] * invfac[pp - r];
        if cor == tmp {
            cand.push(r as i64);
        }
    }
    for r in cand {
        let mut ok = true;
        for &(pi, ei) in pe {
            if exp(pi, p) - exp(pi, p - r) - exp(pi, r) != ei {
                ok = false;
                break;
            }
        }
        if ok {
            return Some((p, r));
        }
    }
    None
}

fn main() {
    input! {
        k: usize,
        pe: [(i64, i64); k],
    }
    if let Some((p, r)) = calc(&pe) {
        println!("{} {}", p, r);
    } else {
        println!("-1 -1");
    }
}
0