結果

問題 No.886 Direct
ユーザー koba-e964koba-e964
提出日時 2020-01-04 21:46:43
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 203 ms / 4,000 ms
コード長 6,912 bytes
コンパイル時間 13,015 ms
コンパイル使用メモリ 389,736 KB
実行使用メモリ 28,440 KB
最終ジャッジ日時 2024-05-02 08:49:11
合計ジャッジ時間 21,499 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 191 ms
28,440 KB
testcase_01 AC 182 ms
28,200 KB
testcase_02 AC 193 ms
28,312 KB
testcase_03 AC 197 ms
28,252 KB
testcase_04 AC 196 ms
28,208 KB
testcase_05 AC 194 ms
28,316 KB
testcase_06 AC 188 ms
28,276 KB
testcase_07 AC 195 ms
28,356 KB
testcase_08 AC 197 ms
28,192 KB
testcase_09 AC 203 ms
28,432 KB
testcase_10 AC 190 ms
28,196 KB
testcase_11 AC 190 ms
28,256 KB
testcase_12 AC 200 ms
28,216 KB
testcase_13 AC 197 ms
28,196 KB
testcase_14 AC 182 ms
28,312 KB
testcase_15 AC 179 ms
28,324 KB
testcase_16 AC 185 ms
28,304 KB
testcase_17 AC 191 ms
28,192 KB
testcase_18 AC 196 ms
28,268 KB
testcase_19 AC 192 ms
28,416 KB
testcase_20 AC 197 ms
28,192 KB
testcase_21 AC 194 ms
28,272 KB
testcase_22 AC 186 ms
28,212 KB
testcase_23 AC 200 ms
28,352 KB
testcase_24 AC 199 ms
28,260 KB
testcase_25 AC 183 ms
28,192 KB
testcase_26 AC 186 ms
28,188 KB
testcase_27 AC 186 ms
28,196 KB
testcase_28 AC 202 ms
28,272 KB
testcase_29 AC 198 ms
28,268 KB
testcase_30 AC 185 ms
28,252 KB
testcase_31 AC 173 ms
28,376 KB
testcase_32 AC 192 ms
28,276 KB
testcase_33 AC 192 ms
28,284 KB
testcase_34 AC 195 ms
28,248 KB
testcase_35 AC 185 ms
28,204 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// 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);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/// Verified by https://atcoder.jp/contests/arc093/submissions/3968098
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, 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 ModInt = mod_int::ModInt<P>;

// #{(a, b) : 0 <= a, b < x, g | b - a}
// = x + 2 ((x - g) + ... + (x - q * g))
// = x + 2 * q * x - g * q * (q + 1)
fn calc(x: i64, g: i64) -> ModInt {
    let q = x / g;
    let tmp = ModInt::new(x) * (2 * q + 1);
    let tmp = tmp - ModInt::new(q * (q + 1)) * g;
    tmp
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        h: i64, w: i64,
    }
    const A: usize = 3_000_001;
    let mut dp = vec![ModInt::new(0); A];
    for g in 1..A as i64 {
        dp[g as usize] = calc(h, g) * calc(w, g) - h * w;
    }
    // inex
    let mut pr = vec![true; A];
    pr[0] = false;
    pr[1] = false;
    for i in 2..A {
        if !pr[i] { continue; }
        for j in 2..=(A - 1) / i {
            pr[i * j] = false;
        }
    }
    for p in 2..A {
        if !pr[p] { continue; }
        for i in 1..=(A - 1) / p {
            let val = dp[i * p];
            dp[i] -= val;
        }
    }
    puts!("{}\n", dp[1] * ModInt::new(2).inv());
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0