結果

問題 No.1261 数字集め
ユーザー akakimidoriakakimidori
提出日時 2020-10-17 11:32:35
言語 Rust
(1.77.0)
結果
AC  
実行時間 6,111 ms / 8,000 ms
コード長 9,690 bytes
コンパイル時間 4,178 ms
コンパイル使用メモリ 155,140 KB
実行使用メモリ 22,988 KB
最終ジャッジ日時 2023-09-28 11:13:45
合計ジャッジ時間 393,916 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6,070 ms
22,852 KB
testcase_01 AC 1,845 ms
10,408 KB
testcase_02 AC 4,194 ms
19,400 KB
testcase_03 AC 4,274 ms
19,396 KB
testcase_04 AC 2,605 ms
11,952 KB
testcase_05 AC 5,758 ms
22,344 KB
testcase_06 AC 3,031 ms
12,756 KB
testcase_07 AC 4,486 ms
19,704 KB
testcase_08 AC 2,321 ms
11,520 KB
testcase_09 AC 3,133 ms
13,020 KB
testcase_10 AC 97 ms
4,376 KB
testcase_11 AC 5,701 ms
22,096 KB
testcase_12 AC 5,060 ms
20,892 KB
testcase_13 AC 4,555 ms
19,788 KB
testcase_14 AC 363 ms
4,376 KB
testcase_15 AC 2,040 ms
10,732 KB
testcase_16 AC 4,431 ms
19,736 KB
testcase_17 AC 3,491 ms
17,836 KB
testcase_18 AC 2,088 ms
10,796 KB
testcase_19 AC 4,293 ms
19,320 KB
testcase_20 AC 465 ms
4,376 KB
testcase_21 AC 6,027 ms
22,748 KB
testcase_22 AC 6,061 ms
22,736 KB
testcase_23 AC 6,080 ms
22,676 KB
testcase_24 AC 6,050 ms
22,748 KB
testcase_25 AC 6,027 ms
22,724 KB
testcase_26 AC 6,033 ms
22,740 KB
testcase_27 AC 6,062 ms
22,764 KB
testcase_28 AC 6,019 ms
22,744 KB
testcase_29 AC 6,032 ms
22,756 KB
testcase_30 AC 6,056 ms
22,724 KB
testcase_31 AC 6,063 ms
22,752 KB
testcase_32 AC 6,062 ms
22,744 KB
testcase_33 AC 6,085 ms
22,864 KB
testcase_34 AC 6,111 ms
22,744 KB
testcase_35 AC 6,105 ms
22,724 KB
testcase_36 AC 6,094 ms
22,748 KB
testcase_37 AC 6,075 ms
22,836 KB
testcase_38 AC 6,091 ms
22,700 KB
testcase_39 AC 6,076 ms
22,728 KB
testcase_40 AC 6,074 ms
22,712 KB
testcase_41 AC 6,069 ms
22,716 KB
testcase_42 AC 6,063 ms
22,716 KB
testcase_43 AC 6,073 ms
22,656 KB
testcase_44 AC 5,242 ms
21,248 KB
testcase_45 AC 971 ms
6,568 KB
testcase_46 AC 2,632 ms
12,276 KB
testcase_47 AC 1,765 ms
10,404 KB
testcase_48 AC 4,349 ms
19,496 KB
testcase_49 AC 5,226 ms
21,188 KB
testcase_50 AC 4,641 ms
20,268 KB
testcase_51 AC 1,136 ms
6,844 KB
testcase_52 AC 65 ms
4,376 KB
testcase_53 AC 1,143 ms
6,856 KB
testcase_54 AC 1,324 ms
7,384 KB
testcase_55 AC 568 ms
4,620 KB
testcase_56 AC 743 ms
6,188 KB
testcase_57 AC 4,085 ms
19,020 KB
testcase_58 AC 1,008 ms
6,536 KB
testcase_59 AC 5,359 ms
21,724 KB
testcase_60 AC 1,256 ms
7,204 KB
testcase_61 AC 1,871 ms
10,444 KB
testcase_62 AC 4,795 ms
20,500 KB
testcase_63 AC 662 ms
4,692 KB
testcase_64 AC 5,820 ms
22,516 KB
testcase_65 AC 3,683 ms
18,248 KB
testcase_66 AC 3,072 ms
12,744 KB
testcase_67 AC 4,824 ms
20,552 KB
testcase_68 AC 2,868 ms
12,648 KB
testcase_69 AC 2,811 ms
12,348 KB
testcase_70 AC 2,105 ms
11,224 KB
testcase_71 AC 4,534 ms
19,840 KB
testcase_72 AC 1,461 ms
7,636 KB
testcase_73 AC 1,740 ms
10,384 KB
testcase_74 AC 752 ms
6,044 KB
testcase_75 AC 2,571 ms
12,180 KB
testcase_76 AC 4,111 ms
18,992 KB
testcase_77 AC 4,823 ms
20,464 KB
testcase_78 AC 10 ms
4,376 KB
testcase_79 AC 5,054 ms
20,864 KB
testcase_80 AC 57 ms
4,376 KB
testcase_81 AC 400 ms
4,376 KB
testcase_82 AC 3,861 ms
18,624 KB
testcase_83 AC 1,546 ms
10,096 KB
testcase_84 AC 6,071 ms
22,936 KB
testcase_85 AC 6,082 ms
22,960 KB
testcase_86 AC 6,076 ms
22,988 KB
testcase_87 AC 6,069 ms
22,904 KB
testcase_88 AC 6,056 ms
22,952 KB
testcase_89 AC 6,069 ms
22,944 KB
testcase_90 AC 6,081 ms
22,900 KB
testcase_91 AC 6,055 ms
22,940 KB
testcase_92 AC 6,045 ms
22,980 KB
testcase_93 AC 6,062 ms
22,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin ModInt ----------
mod modint {

    #[allow(dead_code)]
    pub struct Mod;
    impl ConstantModulo for Mod {
        const MOD: u32 = 1_000_000_007;
    }

    #[allow(dead_code)]
    pub struct StaticMod;
    static mut STATIC_MOD: u32 = 0;
    impl Modulo for StaticMod {
        fn modulo() -> u32 {
            unsafe { STATIC_MOD }
        }
    }

    #[allow(dead_code)]
    impl StaticMod {
        pub fn set_modulo(p: u32) {
            unsafe {
                STATIC_MOD = p;
            }
        }
    }

    use std::marker::*;
    use std::ops::*;

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

    pub trait ConstantModulo {
        const MOD: u32;
    }

    impl<T> Modulo for T
    where
        T: ConstantModulo,
    {
        fn modulo() -> u32 {
            T::MOD
        }
    }

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

    impl<T> Clone for ModInt<T> {
        fn clone(&self) -> Self {
            ModInt::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 d = self.0 + rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    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 d = T::modulo() + self.0 - rhs.0;
            if d >= T::modulo() {
                d -= T::modulo();
            }
            ModInt::new_unchecked(d)
        }
    }

    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;
            ModInt::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.0 == 0 {
                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: 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 m = T::modulo() as i64;
            ModInt::new((val % m + m) as u32)
        }
    }

    #[allow(dead_code)]
    impl<T> ModInt<T> {
        pub fn new_unchecked(d: u32) -> Self {
            ModInt(d, 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
        }
    }

    #[allow(dead_code)]
    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.0 != 0);
            self.pow(T::modulo() as u64 - 2)
        }
    }

    #[allow(dead_code)]
    pub fn mod_pow(r: u64, mut n: u64, m: u64) -> u64 {
        let mut t = 1 % m;
        let mut s = r % m;
        while n > 0 {
            if n & 1 == 1 {
                t = t * s % m;
            }
            s = s * s % m;
            n >>= 1;
        }
        t
    }
}
// ---------- end ModInt ----------
// ---------- begin Precalc ----------
mod precalc {
    use super::modint::*;
    #[allow(dead_code)]
    pub struct Precalc<T> {
        inv: Vec<ModInt<T>>,
        fact: Vec<ModInt<T>>,
        ifact: Vec<ModInt<T>>,
    }
    #[allow(dead_code)]
    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 + 1) {
                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 {
                inv: inv,
                fact: fact,
                ifact: ifact,
            }
        }
        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 comb(&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 ----------
// ---------- 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::io::Write;
use modint::*;
type M = ModInt<Mod>;

fn run() {
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    input! {
        n: usize,
        m: usize,
        a: [M; n - 1],
        q: usize,
        ask: [(usize, usize); q],
    }
    let mut a = a;
    a.insert(0, M::one());
    a.insert(0, M::one());
    let m = m - 3;
    a.iter_mut().for_each(|a| *a -= M::one());
    let pow = a.iter().map(|a| a.pow((m + 1) as u64)).collect::<Vec<_>>();
    let calc = |x: usize, y: usize, z: usize| -> M {
        assert!(1 < x && x < y && y < z && z == n);
        let (p, q, r) = (pow[x], pow[y], pow[z]);
        let (a, b, c) = (a[x], a[y], a[z]);
        (b * (r - q) * (c - b).inv() - a * (r - p) * (c - a).inv()) * (b - a).inv()
    };
    let mut to = vec![false; n + 1];
    let mut sum = vec![M::zero(); n + 1];
    let mut ans = M::zero();
    for i in 2..n {
        to[i] = n % i == 0;
        for j in 2..=(n / i) {
            let j = j * i;
            if j == n {
                continue;
            }
            if n % j == 0 {
                ans += calc(i, j, n);
            } else {
                sum[j] += calc(i, j, n);
            }
        }
    }
    writeln!(out, "{}", ans).ok();
    for (x, y) in ask {
        if y == n {
            ans += sum[x];
            to[x] = true;
        } else {
            let v = calc(x, y, n);
            if to[y] {
                ans += v;
            }
            sum[y] += v;
        }
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}
0