結果

問題 No.1667 Forest
ユーザー phsplsphspls
提出日時 2022-10-09 12:40:48
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,476 ms / 3,000 ms
コード長 1,686 bytes
コンパイル時間 1,858 ms
コンパイル使用メモリ 147,036 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-05 17:17:29
合計ジャッジ時間 11,818 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,476 ms
4,380 KB
testcase_01 AC 1,457 ms
4,380 KB
testcase_02 AC 1,427 ms
4,380 KB
testcase_03 AC 9 ms
4,376 KB
testcase_04 AC 1,410 ms
4,376 KB
testcase_05 AC 801 ms
4,376 KB
testcase_06 AC 464 ms
4,376 KB
testcase_07 AC 270 ms
4,376 KB
testcase_08 AC 120 ms
4,380 KB
testcase_09 AC 67 ms
4,376 KB
testcase_10 AC 31 ms
4,380 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 1 ms
4,380 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable `MOD` should have a snake case name
 --> Main.rs:2:37
  |
2 | fn power(base: usize, times: usize, MOD: usize) -> usize {
  |                                     ^^^
  |
  = note: `#[warn(non_snake_case)]` on by default
help: rename the identifier or convert it to a snake case raw identifier
  |
2 | fn power(base: usize, times: usize, r#mod: usize) -> usize {
  |                                     ~~~~~

warning: variable `MOD` should have a snake case name
 --> Main.rs:9:26
  |
9 | fn fact_inv(size: usize, MOD: usize) -> (Vec<usize>, Vec<usize>) {
  |                          ^^^
  |
help: rename the identifier or convert it to a snake case raw identifier
  |
9 | fn fact_inv(size: usize, r#mod: usize) -> (Vec<usize>, Vec<usize>) {
  |                          ~~~~~

warning: variable `MOD` should have a snake case name
  --> Main.rs:26:73
   |
26 | fn comb(n: usize, r: usize, facts: &Vec<usize>, fact_invs: &Vec<usize>, MOD: usize) -> usize {
   |                                                                         ^^^
   |
help: rename the identifier or convert it to a snake case raw identifier
   |
26 | fn comb(n: usize, r: usize, facts: &Vec<usize>, fact_invs: &Vec<usize>, r#mod: usize) -> usize {
   |                                                                         ~~~~~

warning: variable `MOD` should have a snake case name
  --> Main.rs:35:9
   |
35 |     let MOD = temp[1];
   |         ^^^
   |
help: rename the identifier or convert it to a snake case raw identifier
   |
35 |     let r#mod = temp[1];
   |         ~~~~~

warning: 4 warnings emitted

ソースコード

diff # 

fn power(base: usize, times: usize, MOD: usize) -> usize {
    if times == 0 { return 1usize; }
    if times == 1 { return base; }
    let temp = power(base, times/2, MOD);
    temp * temp % MOD * power(base, times%2, MOD) % MOD
}

fn fact_inv(size: usize, MOD: usize) -> (Vec<usize>, Vec<usize>) {
    let mut facts = vec![0usize; size+1];
    let mut fact_invs = vec![0usize; size+1];
    let mut invs = vec![0usize; size+1];
    facts[0] = 1;
    facts[1] = 1;
    fact_invs[0] = 1;
    fact_invs[1] = 1;
    invs[1] = 1;
    for i in 2..=size {
        facts[i] = facts[i-1] * i % MOD;
        invs[i] = MOD - invs[MOD % i] * (MOD / i) % MOD;
        fact_invs[i] = fact_invs[i - 1] * invs[i] % MOD;
    }
    (facts, fact_invs)
}

fn comb(n: usize, r: usize, facts: &Vec<usize>, fact_invs: &Vec<usize>, MOD: usize) -> usize {
    facts[n] * fact_invs[r] % MOD * fact_invs[n-r] % MOD
}

fn main() {
    let mut temp = String::new();
    std::io::stdin().read_line(&mut temp).ok();
    let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = temp[0];
    let MOD = temp[1];

    let (facts, fact_invs) = fact_inv(1000, MOD);
    let mut dp = vec![vec![0usize; n]; n+1];
    dp[0][0] = 1;
    for i in 0..n {
        for j in 0..n {
            dp[i+1][j] += dp[i][j];
            dp[i+1][j] %= MOD;
            for k in 2..=n {
                if i+k > n || j+k-1 >= n { break; }
                dp[i+k][j+k-1] += dp[i][j] * comb(n-i-1, k-1, &facts, &fact_invs, MOD) % MOD * power(k, k-2, MOD) % MOD;
                dp[i+k][j+k-1] %= MOD;
            }
        }
    }
    for &v in dp[n].iter() {
        println!("{}", v);
    }
}
0