結果

問題 No.1044 正直者大学
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-05-02 00:27:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 114 ms / 2,000 ms
コード長 4,079 bytes
コンパイル時間 2,830 ms
コンパイル使用メモリ 90,060 KB
実行使用メモリ 39,996 KB
最終ジャッジ日時 2024-06-07 13:37:07
合計ジャッジ時間 6,305 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
37,976 KB
testcase_01 AC 75 ms
37,988 KB
testcase_02 AC 73 ms
38,044 KB
testcase_03 AC 70 ms
38,092 KB
testcase_04 AC 68 ms
38,288 KB
testcase_05 AC 84 ms
39,788 KB
testcase_06 AC 114 ms
39,848 KB
testcase_07 AC 71 ms
38,088 KB
testcase_08 AC 75 ms
38,376 KB
testcase_09 AC 74 ms
38,004 KB
testcase_10 AC 72 ms
37,932 KB
testcase_11 AC 70 ms
38,180 KB
testcase_12 AC 82 ms
39,328 KB
testcase_13 AC 102 ms
39,488 KB
testcase_14 AC 83 ms
39,524 KB
testcase_15 AC 87 ms
39,996 KB
testcase_16 AC 101 ms
39,484 KB
testcase_17 AC 88 ms
38,812 KB
testcase_18 AC 95 ms
38,848 KB
testcase_19 AC 82 ms
38,592 KB
testcase_20 AC 75 ms
38,260 KB
testcase_21 AC 80 ms
38,492 KB
testcase_22 AC 78 ms
38,968 KB
testcase_23 AC 85 ms
39,840 KB
testcase_24 AC 87 ms
39,368 KB
testcase_25 AC 80 ms
39,136 KB
testcase_26 AC 84 ms
39,488 KB
testcase_27 AC 73 ms
37,884 KB
testcase_28 AC 70 ms
38,188 KB
testcase_29 AC 73 ms
37,852 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {

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

    if (n > m) {
      int tmp = n;
      n = m;
      m = tmp;
    }
    // n <= m
    long ret = 0;
    int mod = 1000000007;
    int[][] fif = enumFIF(n + m, mod);

    int y = n + m - k;
    long f = (long) fif[0][n - 1] * fif[0][m] % mod;

    for (int i = 1; i <= Math.min(n, y / 2); i++) {
      long now1 = C(n - 1, i - 1, mod, fif) * C(m - 1, i - 1, mod, fif) % mod;
      long now2 = C(n - 1, i, mod, fif) * C(m - 1, i - 1, mod, fif) % mod;
      ret += (now1 + now2) % mod * f % mod;
      ret %= mod;
    }
    System.out.println(ret);
  }

  public static long invl(long a, long mod) {
    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;
    }
    return p < 0 ? p + mod : 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 long C(int n, int r, int mod, int[][] fif) {
    if (n < 0 || r < 0 || r > n)
      return 0;
    return (long) fif[0][n] * fif[1][r] % mod * fif[1][n - r] % mod;
  }


  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