結果

問題 No.1191 数え上げを愛したい（数列編）
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-08-22 17:56:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 146 ms / 2,000 ms
コード長 3,911 bytes
コンパイル時間 2,418 ms
コンパイル使用メモリ 90,716 KB
実行使用メモリ 41,600 KB
最終ジャッジ日時 2024-10-15 11:49:03
合計ジャッジ時間 5,764 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
39,188 KB
testcase_01 AC 125 ms
40,364 KB
testcase_02 AC 98 ms
40,052 KB
testcase_03 AC 99 ms
40,784 KB
testcase_04 AC 122 ms
41,092 KB
testcase_05 AC 81 ms
39,068 KB
testcase_06 AC 146 ms
41,464 KB
testcase_07 AC 106 ms
40,976 KB
testcase_08 AC 106 ms
40,740 KB
testcase_09 AC 104 ms
41,032 KB
testcase_10 AC 80 ms
39,148 KB
testcase_11 AC 80 ms
39,080 KB
testcase_12 AC 123 ms
41,168 KB
testcase_13 AC 132 ms
41,600 KB
testcase_14 AC 136 ms
41,448 KB
testcase_15 AC 73 ms
38,008 KB
testcase_16 AC 74 ms
37,668 KB
testcase_17 AC 71 ms
37,960 KB
testcase_18 AC 71 ms
38,036 KB
testcase_19 AC 72 ms
37,668 KB
testcase_20 AC 72 ms
38,292 KB
testcase_21 AC 72 ms
37,972 KB
testcase_22 AC 80 ms
39,160 KB
testcase_23 AC 71 ms
38,204 KB
testcase_24 AC 75 ms
38,152 KB
testcase_25 AC 75 ms
38,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {

  private static void solve() {
    int n = ni();
    int m = ni();
    int a = ni();
    int b = ni();

    if (1 + (long) (n - 1) * a > m) {
      System.out.println(0);
      return;
    }

    m -= 1 + (n - 1) * a;
    b -= (n - 1) * a;

    int mod = 998244353;
    int[][] fif = enumFIF(m + n, mod);
    long ret = 0;
    for (int i = 0; i <= b; i++) {
      ret += CX(n + i - 2, i, mod, fif) * (m - i + 1) % mod;
      ret %= mod;
    }

    ret *= fif[0][n];
    ret %= mod;
    System.out.println(ret);
  }

  public static long CX(long n, long r, int p, int[][] fif) {
    if (n < 0 || r < 0 || r > n)
      return 0;
    int np = (int) (n % p), rp = (int) (r % p);
    if (np < rp)
      return 0;
    if (n == 0 && r == 0)
      return 1;
    int nrp = np - rp;
    if (nrp < 0)
      nrp += p;
    return (long) fif[0][np] * fif[1][rp] % p * fif[1][nrp] % p * CX(n / p, r / p, p, fif) % p;
  }

  public static int[][] enumFIF(int n, int mod) {
    int[] f = new int[n + 1];
    int[] invf = new int[n + 1];
    f[0] = 1;
    for (int i = 1; i <= n; i++) {
      f[i] = (int) ((long) f[i - 1] * i % mod);
    }
    long a = f[n];
    long b = mod;
    long p = 1, q = 0;
    while (b > 0) {
      long c = a / b;
      long d;
      d = a;
      a = b;
      b = d % b;
      d = p;
      p = q;
      q = d - c * q;
    }
    invf[n] = (int) (p < 0 ? p + mod : p);
    for (int i = n - 1; i >= 0; i--) {
      invf[i] = (int) ((long) invf[i + 1] * (i + 1) % mod);
    }
    return new int[][] { f, invf };
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0