結果

問題 No.3004 ヤング図形
ユーザー ArcAki
提出日時 2025-01-17 22:14:34
言語 Rust
(1.83.0 + proconio)
結果
MLE  
実行時間 -
コード長 2,758 bytes
コンパイル時間 28,543 ms
コンパイル使用メモリ 400,652 KB
実行使用メモリ 874,992 KB
最終ジャッジ日時 2025-01-17 22:16:07
合計ジャッジ時間 79,794 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16 TLE * 6 MLE * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#[allow(unused_imports)]
use std::{
    collections::*,
    cmp::*,
    mem::swap,
    time::Instant,
    io::{self, stdin, Read, read_to_string},
    hash::Hash,
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
//use ac_library::{*};
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
//use proconio::fastout;
//#[fastout]
fn main(){
    input!{
        k: usize,
        query: [(i64, i64); k],
    }
    let mut rest = 0;
    for &(u, v) in &query{
        rest += u*v;
    }
    let mut ac = rest;
    let mut need = HashSet::new();
    for &(u, v) in &query{
        need.insert(ac);
        need.insert(u*v);
        need.insert(ac-u*v);
        ac -= u*v;
        let mut sub = u*v;
        need.insert(u-1);
        for _ in 0..v{
            sub -= 1;
            need.insert(sub);
            need.insert(sub-u+1);
            sub -= u-1;
        }
    }
    let mut z = 1;
    let mut f = HashMap::new();
    let mut inv = HashMap::new();
    f.insert(0, 1);
    inv.insert(0, 1);
    for i in 1..=rest{
        z = (z*i)%MOD;
        if need.contains(&i){
            f.insert(i, z);
            inv.insert(i, mod_inverse(z, MOD));
        }
    }
    let mut ans = 1;
    for &(u, v) in &query{
        ans = (ans*f[&rest]%MOD*inv[&(u*v)]%MOD*inv[&(rest-u*v)])%MOD;
        let mut sub = u*v;
        rest -= sub;
        for _ in 0..v{
            sub -= 1;
            ans = (ans*f[&sub]%MOD*inv[&(u-1)]%MOD*inv[&(sub-u+1)])%MOD;
            sub -= u-1;
        }
    }
    println!("{}", ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0