結果

問題 No.1261 数字集め
ユーザー akakimidoriakakimidori
提出日時 2020-10-16 23:43:28
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 3,045 ms / 8,000 ms
コード長 13,226 bytes
コンパイル時間 12,405 ms
コンパイル使用メモリ 379,988 KB
実行使用メモリ 191,472 KB
最終ジャッジ日時 2024-07-21 04:57:02
合計ジャッジ時間 133,817 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3,045 ms
190,812 KB
testcase_01 AC 368 ms
63,788 KB
testcase_02 AC 1,176 ms
135,856 KB
testcase_03 AC 1,144 ms
137,484 KB
testcase_04 AC 613 ms
87,336 KB
testcase_05 AC 1,732 ms
182,672 KB
testcase_06 AC 798 ms
99,580 KB
testcase_07 AC 1,285 ms
142,492 KB
testcase_08 AC 609 ms
78,172 KB
testcase_09 AC 760 ms
103,372 KB
testcase_10 AC 56 ms
5,760 KB
testcase_11 AC 1,818 ms
180,100 KB
testcase_12 AC 1,513 ms
160,760 KB
testcase_13 AC 1,277 ms
144,524 KB
testcase_14 AC 41 ms
15,684 KB
testcase_15 AC 522 ms
69,220 KB
testcase_16 AC 1,214 ms
142,904 KB
testcase_17 AC 955 ms
114,576 KB
testcase_18 AC 519 ms
70,704 KB
testcase_19 AC 1,185 ms
138,160 KB
testcase_20 AC 81 ms
18,960 KB
testcase_21 AC 3,045 ms
190,920 KB
testcase_22 AC 1,770 ms
191,052 KB
testcase_23 AC 1,850 ms
190,924 KB
testcase_24 AC 1,732 ms
191,048 KB
testcase_25 AC 1,869 ms
191,176 KB
testcase_26 AC 1,819 ms
191,044 KB
testcase_27 AC 1,753 ms
190,924 KB
testcase_28 AC 1,882 ms
190,916 KB
testcase_29 AC 1,716 ms
191,116 KB
testcase_30 AC 1,788 ms
191,048 KB
testcase_31 AC 1,771 ms
191,052 KB
testcase_32 AC 1,848 ms
191,048 KB
testcase_33 AC 1,951 ms
191,048 KB
testcase_34 AC 1,889 ms
191,172 KB
testcase_35 AC 1,767 ms
191,048 KB
testcase_36 AC 1,791 ms
191,172 KB
testcase_37 AC 1,859 ms
191,048 KB
testcase_38 AC 1,933 ms
190,920 KB
testcase_39 AC 1,865 ms
191,044 KB
testcase_40 AC 1,780 ms
190,972 KB
testcase_41 AC 1,717 ms
191,048 KB
testcase_42 AC 1,709 ms
191,048 KB
testcase_43 AC 1,868 ms
191,052 KB
testcase_44 AC 1,605 ms
168,008 KB
testcase_45 AC 274 ms
36,784 KB
testcase_46 AC 725 ms
90,092 KB
testcase_47 AC 423 ms
62,288 KB
testcase_48 AC 1,226 ms
140,084 KB
testcase_49 AC 1,489 ms
166,064 KB
testcase_50 AC 1,334 ms
148,184 KB
testcase_51 AC 198 ms
41,404 KB
testcase_52 AC 32 ms
5,376 KB
testcase_53 AC 310 ms
41,752 KB
testcase_54 AC 341 ms
47,512 KB
testcase_55 AC 154 ms
22,680 KB
testcase_56 AC 229 ms
28,724 KB
testcase_57 AC 1,246 ms
132,660 KB
testcase_58 AC 295 ms
37,680 KB
testcase_59 AC 1,571 ms
170,928 KB
testcase_60 AC 249 ms
46,108 KB
testcase_61 AC 427 ms
64,924 KB
testcase_62 AC 1,338 ms
152,772 KB
testcase_63 AC 90 ms
26,044 KB
testcase_64 AC 1,796 ms
184,456 KB
testcase_65 AC 996 ms
120,588 KB
testcase_66 AC 801 ms
100,396 KB
testcase_67 AC 1,428 ms
154,132 KB
testcase_68 AC 714 ms
94,820 KB
testcase_69 AC 619 ms
92,544 KB
testcase_70 AC 574 ms
73,032 KB
testcase_71 AC 1,256 ms
145,720 KB
testcase_72 AC 353 ms
52,072 KB
testcase_73 AC 546 ms
60,872 KB
testcase_74 AC 158 ms
29,328 KB
testcase_75 AC 744 ms
86,852 KB
testcase_76 AC 1,089 ms
133,056 KB
testcase_77 AC 1,338 ms
155,528 KB
testcase_78 AC 27 ms
5,376 KB
testcase_79 AC 1,390 ms
161,724 KB
testcase_80 AC 61 ms
5,376 KB
testcase_81 AC 141 ms
16,896 KB
testcase_82 AC 1,034 ms
125,388 KB
testcase_83 AC 442 ms
55,092 KB
testcase_84 AC 1,896 ms
191,348 KB
testcase_85 AC 1,879 ms
191,344 KB
testcase_86 AC 2,010 ms
191,224 KB
testcase_87 AC 1,937 ms
191,344 KB
testcase_88 AC 1,872 ms
191,220 KB
testcase_89 AC 1,852 ms
191,300 KB
testcase_90 AC 1,892 ms
191,352 KB
testcase_91 AC 1,810 ms
191,348 KB
testcase_92 AC 1,779 ms
191,472 KB
testcase_93 AC 1,979 ms
191,348 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 Matrix ----------
#[allow(dead_code)]
mod matrix {
    use std::ops::{Add, Mul};
    pub trait SemiRing: Add<Output = Self> + Mul<Output = Self> + Copy {
        fn zero() -> Self;
        fn one() -> Self;
    }
    pub const SIZE: usize = 3;
    #[derive(Clone)]
    pub struct SquareMatrix<T: SemiRing> {
        buf: [[T; SIZE]; SIZE],
    }
    impl<T: SemiRing> SquareMatrix<T> {
        pub fn zero() -> Self {
            let z = T::zero();
            SquareMatrix {
                buf: [[z; SIZE]; SIZE],
            }
        }
        pub fn identity() -> Self {
            let mut m = Self::zero();
            for i in 0..SIZE {
                m.buf[i][i] = T::one();
            }
            m
        }
        pub fn set_at(&mut self, i: usize, j: usize, v: T) {
            self.buf[i][j] = v;
        }
        pub fn get_at(&self, i: usize, j: usize) -> T {
            self.buf[i][j]
        }
        pub fn matmul(&self, rhs: &Self) -> Self {
            let mut res = Self::zero();
            for (x, a) in res.buf.iter_mut().zip(self.buf.iter()) {
                for (a, b) in a.iter().zip(rhs.buf.iter()) {
                    for (x, b) in x.iter_mut().zip(b.iter()) {
                        *x = *x + *a * *b;
                    }
                }
            }
            res
        }
        pub fn matadd(&self, rhs: &Self) -> Self {
            let mut c = Self::zero();
            for (c, (a, b)) in c.buf.iter_mut().zip(self.buf.iter().zip(rhs.buf.iter())) {
                for (c, (a, b)) in c.iter_mut().zip(a.iter().zip(b.iter())) {
                    *c = *a + *b;
                }
            }
            c
        }
        pub fn matpow(&self, mut n: usize) -> Self {
            let mut t = Self::identity();
            let mut s = self.clone();
            while n > 0 {
                if n & 1 == 1 {
                    t = t.matmul(&s);
                }
                s = s.matmul(&s);
                n >>= 1;
            }
            t
        }
    }
}
// ---------- end Matrix ----------
// ---------- 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 ----------

// クエリなしの時どうやって解くの
// パス1 -> a -> b -> N を全列挙できるとして
// sum (x + y + z == m - 3) (A_a - 1) ^ x * (A_b - 1) ^ y * (A_n - 1) ^ z
// これらの和
// これ求められん...
// 行列累乗でなんとかごまかせるが許されるか？
//
// クエリ
// X -> Yを追加するとできるパスってなんだ？
// Y = N なら
// 1 -> z -> X -> Y
// Y != N なら
// 1 -> X -> Y -> N
// のどれか
// その度に列挙、足しこむのって大丈夫か？
//

use std::io::Write;

use matrix::*;
use modint::*;
type M = ModInt<Mod>;
type Mat = SquareMatrix<M>;

impl SemiRing for M {
    fn zero() -> Self {
        M::zero()
    }
    fn one() -> Self {
        M::one()
    }
}

fn run() {
    input! {
        n: usize,
        m: usize,
        a: [usize; n - 1],
        q: usize,
        ask: [(usize, usize); q],
    }
    let mut a = a;
    a.insert(0, 1);
    a.insert(0, 1);
    let a = a.into_iter().map(|a| M::from(a - 1)).collect::<Vec<_>>();
    let mut ans = M::zero();
    let mut from = vec![vec![]; n + 1];
    let mut to = vec![false; n + 1];
    for i in 2..n {
        to[i] = n % i == 0;
        let mut j = 2 * i;
        while j < n {
            if n % j == 0 {
                let mut mat = Mat::zero();
                mat.set_at(0, 0, a[i]);
                mat.set_at(1, 0, a[j]);
                mat.set_at(1, 1, a[j]);
                mat.set_at(2, 0, a[n]);
                mat.set_at(2, 1, a[n]);
                mat.set_at(2, 2, a[n]);
                let pow = mat.matpow(m - 3);
                for i in 0..3 {
                    ans += pow.get_at(i, 0);
                }
            } else {
                from[j].push(i);
            }
            j += i;
        }
    }
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    writeln!(out, "{}", ans).ok();
    for (x, y) in ask {
        if y == n {
            for &z in from[x].iter() {
                let mut mat = Mat::zero();
                mat.set_at(0, 0, a[z]);
                mat.set_at(1, 0, a[x]);
                mat.set_at(1, 1, a[x]);
                mat.set_at(2, 0, a[y]);
                mat.set_at(2, 1, a[y]);
                mat.set_at(2, 2, a[y]);
                let pow = mat.matpow(m - 3);
                for i in 0..3 {
                    ans += pow.get_at(i, 0);
                }
            }
            to[x] = true;
        } else {
            if to[y] {
                let mut mat = Mat::zero();
                mat.set_at(0, 0, a[x]);
                mat.set_at(1, 0, a[y]);
                mat.set_at(1, 1, a[y]);
                mat.set_at(2, 0, a[n]);
                mat.set_at(2, 1, a[n]);
                mat.set_at(2, 2, a[n]);
                let pow = mat.matpow(m - 3);
                for i in 0..3 {
                    ans += pow.get_at(i, 0);
                }
            }
            from[y].push(x);
        }
        writeln!(out, "{}", ans).ok();
    }
}

fn main() {
    run();
}
0