#925962 (Rust) No.2527 H and W

提出ソース

結果

問題	No.2527 H and W
ユーザー	Moss_Local
提出日時	2023-11-03 22:49:59
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	61 ms / 2,000 ms
コード長	14,112 bytes
コンパイル時間	11,074 ms
コンパイル使用メモリ	405,752 KB
実行使用メモリ	49,108 KB
最終ジャッジ日時	2024-09-25 21:13:02
合計ジャッジ時間	13,473 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 48,812 KB
testcase_01	AC	46 ms 49,004 KB
testcase_02	AC	56 ms 49,012 KB
testcase_03	AC	46 ms 49,024 KB
testcase_04	AC	46 ms 48,792 KB
testcase_05	AC	48 ms 49,108 KB
testcase_06	AC	49 ms 48,960 KB
testcase_07	AC	47 ms 49,032 KB
testcase_08	AC	57 ms 48,956 KB
testcase_09	AC	59 ms 48,928 KB
testcase_10	AC	61 ms 49,016 KB
testcase_11	AC	47 ms 48,996 KB
testcase_12	AC	52 ms 48,936 KB
testcase_13	AC	53 ms 48,932 KB
testcase_14	AC	57 ms 48,984 KB
testcase_15	AC	54 ms 49,028 KB
testcase_16	AC	59 ms 48,924 KB
testcase_17	AC	59 ms 49,024 KB
testcase_18	AC	57 ms 49,096 KB
testcase_19	AC	54 ms 49,024 KB
testcase_20	AC	55 ms 48,984 KB
testcase_21	AC	51 ms 49,000 KB
testcase_22	AC	49 ms 49,008 KB
testcase_23	AC	55 ms 49,024 KB
testcase_24	AC	53 ms 48,948 KB
testcase_25	AC	48 ms 49,024 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: unnecessary parentheses around assigned value
   --> src/main.rs:326:19
    |
326 |         self.0 *= (rhs.0 % MOD);
    |                   ^           ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
326 -         self.0 *= (rhs.0 % MOD);
326 +         self.0 *= rhs.0 % MOD;
    |

warning: unused variable: `a2`
   --> src/main.rs:483:18
    |
483 |             let (a2, e2) = self.mod_fact(k, p);
    |                  ^^ help: if this is intentional, prefix it with an underscore: `_a2`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `moi`
   --> src/main.rs:488:21
    |
488 |                 let moi = self.mod_inverse(a3 % p, p);
    |                     ^^^ help: if this is intentional, prefix it with an underscore: `_moi`

warning: unused variable: `a2`
   --> src/main.rs:508:18
    |
508 |             let (a2, e2) = self.mod_fact(k, p);
    |                  ^^ help: if this is intentional, prefix it with an underscore: `_a2`

warning: unused variable: `a3`
   --> src/main.rs:509:18
    |
509 |             let (a3, e3) = self.mod_fact(n - k, p);
    |                  ^^ help: if this is intentional, prefix it with an underscore: `_a3`

warning: unused variable: `ww`
   --> src/main.rs:559:13
    |
559 |         let ww = w as i64;
    |             ^^ help: if this is intentional, prefix it with an underscore: `_ww`

warning: variable does not need to be mutable
   --> src/main.rs:560:13
    |
560 |         let mut rest = h * w - i * w;
    |             ----^^^^
    |             |
    |             help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

ソースコード

raw source code

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readimat(h: usize, w: usize) -> Vec<Vec<i64>> {
    let mut mat = vec![vec![0; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.split_whitespace();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap().parse::<i64>().unwrap();
        }
    }
    mat
}

fn readcmat(h: usize, w: usize) -> Vec<Vec<char>> {
    let mut mat = vec![vec!['.'; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.chars();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap();
        }
    }
    mat
}

fn readiiiii() -> (i64, i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

macro_rules! M {
    (a :expr ) => {
        M::new({ a })
    };
}
#[derive(Copy, Clone, Debug)]
pub struct M(i64);
impl M {
    fn new(x: i64) -> Self {
        M(x.rem_euclid(MOD))
    }
    fn pow(self, n: usize) -> Self {
        match n {
            0 => M::new(1),
            _ => {
                let mut a = self.pow(n >> 1);
                a *= a;
                if n & 1 == 1 {
                    a *= self;
                }
                a
            }
        }
    }
    fn inv(self) -> Self {
        self.pow((MOD - 2) as usize)
    }
}
impl std::ops::Neg for M {
    type Output = M;
    fn neg(self) -> Self::Output {
        Self::new(-self.0)
    }
}
impl std::ops::AddAssign<M> for M {
    fn add_assign(&mut self, rhs: Self) {
        self.0 += rhs.0;
        self.0 %= MOD;
    }
}
impl std::ops::AddAssign<i64> for M {
    fn add_assign(&mut self, rhs: i64) {
        *self += M::new(rhs);
    }
}
impl std::ops::AddAssign<usize> for M {
    fn add_assign(&mut self, rhs: usize) {
        *self += M::new(rhs as i64);
    }
}
impl<T> std::ops::Add<T> for M
where
    M: std::ops::AddAssign<T>,
{
    type Output = Self;
    fn add(self, other: T) -> Self {
        let mut res = self;
        res += other;
        res
    }
}
impl std::ops::SubAssign<M> for M {
    fn sub_assign(&mut self, rhs: Self) {
        self.0 -= rhs.0;
        if self.0 < 0 {
            self.0 %= MOD;
            self.0 += MOD;
        }
    }
}
impl std::ops::SubAssign<i64> for M {
    fn sub_assign(&mut self, rhs: i64) {
        *self -= M::new(rhs);
        if (*self).0 < 0 {
            self.0 %= MOD;
            self.0 += MOD;
        }
    }
}
impl std::ops::SubAssign<usize> for M {
    fn sub_assign(&mut self, rhs: usize) {
        *self -= M::new(rhs as i64);
        if (*self).0 < 0 {
            self.0 %= MOD;
            self.0 += MOD;
        }
    }
}
impl<T> std::ops::Sub<T> for M
where
    M: std::ops::SubAssign<T>,
{
    type Output = Self;
    fn sub(self, other: T) -> Self {
        let mut res = self;
        res -= other;
        res
    }
}
impl std::ops::MulAssign<M> for M {
    fn mul_assign(&mut self, rhs: Self) {
        self.0 %= MOD;

        self.0 *= (rhs.0 % MOD);
        self.0 %= MOD;
    }
}
impl std::ops::MulAssign<i64> for M {
    fn mul_assign(&mut self, rhs: i64) {
        *self *= M::new(rhs);
    }
}
impl std::ops::MulAssign<usize> for M {
    fn mul_assign(&mut self, rhs: usize) {
        *self *= M::new(rhs as i64);
    }
}
impl<T> std::ops::Mul<T> for M
where
    M: std::ops::MulAssign<T>,
{
    type Output = Self;
    fn mul(self, other: T) -> Self {
        let mut res = self;
        res *= other;
        res
    }
}
impl std::ops::DivAssign<M> for M {
    fn div_assign(&mut self, rhs: Self) {
        *self *= rhs.inv();
    }
}
impl std::ops::DivAssign<i64> for M {
    fn div_assign(&mut self, rhs: i64) {
        *self /= M::new(rhs);
    }
}
impl std::ops::DivAssign<usize> for M {
    fn div_assign(&mut self, rhs: usize) {
        *self /= M::new(rhs as i64);
    }
}
impl<T> std::ops::Div<T> for M
where
    M: std::ops::DivAssign<T>,
{
    type Output = Self;
    fn div(self, other: T) -> Self {
        let mut res = self;
        res /= other;
        res
    }
}
impl std::fmt::Display for M {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}
impl std::ops::Deref for M {
    type Target = i64;
    fn deref(&self) -> &Self::Target {
        &self.0
    }
}
impl std::ops::DerefMut for M {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }
}

#[allow(dead_code)]
pub fn gcd(a: usize, b: usize) -> usize {
    if b == 0 {
        a
    } else {
        gcd(b, a % b)
    }
}
#[allow(dead_code)]
pub fn lcm(a: usize, b: usize) -> usize {
    a / gcd(a, b) * b
}
#[allow(dead_code)]
/// (gcd, x, y)
pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) {
    if b == 0 {
        (a, 1, 0)
    } else {
        let (gcd, x, y) = extgcd(b, a % b);
        (gcd, y, x - (a / b) * y)
    }
}
#[allow(dead_code)]
/// x ^ n % m
pub fn mod_pow(x: usize, n: usize, m: usize) -> usize {
    let mut res = 1;
    let mut x = x % m;
    let mut n = n;
    while n > 0 {
        if n & 1 == 1 {
            res = (res * x) % m;
        }
        x = (x * x) % m;
        n >>= 1;
    }
    res
}

pub struct Combination {
    m: usize,
    f_table: Vec<usize>,
    moi: Vec<usize>,
}

impl Combination {
    // 0 <= size <= 10^8 is constrained.
    pub fn new(mod_num: usize, table_size: usize) -> Self {
        Self {
            m: mod_num,
            f_table: vec![0; table_size],
            moi: vec![0; 0],
        }
    }
    pub fn build(&mut self) {
        let size = self.f_table.len();
        self.f_table = self.fact_table(size, self.m);
        self.moi = self.fact_inv_table(size, self.m);
    }
    fn fact_table(&mut self, len: usize, m: usize) -> Vec<usize> {
        let mut res = vec![1; len + 1];
        for i in 2..len + 1 {
            res[i] = (res[i - 1] * i) % m;
        }
        res
    }

    fn fact_inv_table(&mut self, len: usize, m: usize) -> Vec<usize> {
        let mut res = vec![1; len + 1];
        let mut inv = vec![1; len + 1];
        //inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD
        for i in 2..len {
            inv[i] = (m - inv[m % i] * (m / i) % m) % m;
            res[i] = inv[i] * res[i - 1];
            // res[i] = self.mod_inverse(i, m) * res[i - 1];
            // res[i] = 1;
            res[i] %= m;
        }
        res
    }

    pub fn p(&mut self, n: usize, k: usize) -> i64 {
        let p = MOD as usize;
        if k == 0 {
            return 1;
        }
        if n < k {
            0
        } else {
            let (a1, e1) = self.mod_fact(n, p);
            let (a2, e2) = self.mod_fact(k, p);
            let (a3, e3) = self.mod_fact(n - k, p);
            if e1 > e2 + e3 {
                0
            } else {
                let moi = self.mod_inverse(a3 % p, p);
                (a1 * self.mod_inverse(a3 % p, p) % p) as i64
            }
        }
    }
    pub fn c(&mut self, n: usize, k: usize) -> i64 {
        let p = MOD as usize;
        if n == 0 && k == 0 {
            return 1;
        }
        if n == 0 {
            return 0;
        }
        if k == 0 {
            return 1;
        }
        if n < k {
            0
        } else {
            let (a1, e1) = self.mod_fact(n, p);
            let (a2, e2) = self.mod_fact(k, p);
            let (a3, e3) = self.mod_fact(n - k, p);
            if e1 > e2 + e3 {
                0
            } else {
                (((a1 * &self.moi[k]) % p * &self.moi[n - k]) % p) as i64
            }
        }
    }
    pub fn h(&mut self, n: usize, k: usize) -> i64 {
        return self.c(n + k - 1, k);
    }

    pub fn factorial(&mut self, n: usize) -> i64 {
        return self.p(n, n);
    }

    fn extgcd(&mut self, a: i64, b: i64) -> (i64, i64, i64) {
        if b == 0 {
            (a, 1, 0)
        } else {
            let (gcd, x, y) = extgcd(b, a % b);
            (gcd, y, x - (a / b) * y)
        }
    }
    fn mod_inverse(&mut self, a: usize, m: usize) -> usize {
        let (_, x, _) = self.extgcd(a as i64, m as i64);
        ((m as i64 + x) as usize % m) % m
    }
    fn mod_fact(&mut self, n: usize, p: usize) -> (usize, usize) {
        if n == 0 {
            (1, 0)
        } else {
            let (a, b) = self.mod_fact(n / p, p);
            let pow = b + n / p;
            if n / p % 2 != 0 {
                (a * (p - self.f_table[(n % p) as usize]) % p, pow)
            } else {
                (a * self.f_table[(n % p) as usize] % p, pow)
            }
        }
    }
}

fn solve() {
    let (h, w, k) = readuuu();
    let mut res = M(0);
    let mut c: Combination = Combination::new(MOD as usize, 2010100);
    c.build();
    for i in 0..h {
        let hh = (h - i) as i64;
        let ww = w as i64;
        let mut rest = h * w - i * w;
        if rest < k {
            continue;
        }
        if (rest - k) % (hh as usize) != 0 {
            continue;
        }
        let paint = (rest - k) / (hh as usize);
        let mut tmp = M(1);
        tmp *= c.c(h, i);
        tmp *= c.c(w, paint);
        res += tmp;
    }
    p!(res);
    return;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード