結果

問題 No.1596 Distance Sum in 2D Plane
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-07-10 01:47:56
言語 Java21
(openjdk 21)
結果
AC  
実行時間 586 ms / 2,000 ms
コード長 4,061 bytes
コンパイル時間 3,138 ms
コンパイル使用メモリ 85,984 KB
実行使用メモリ 65,868 KB
最終ジャッジ日時 2023-09-14 13:20:12
合計ジャッジ時間 11,518 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
54,836 KB
testcase_01 AC 99 ms
54,776 KB
testcase_02 AC 579 ms
65,720 KB
testcase_03 AC 557 ms
65,224 KB
testcase_04 AC 560 ms
65,616 KB
testcase_05 AC 528 ms
65,392 KB
testcase_06 AC 528 ms
65,352 KB
testcase_07 AC 535 ms
65,760 KB
testcase_08 AC 539 ms
65,464 KB
testcase_09 AC 521 ms
65,792 KB
testcase_10 AC 543 ms
65,372 KB
testcase_11 AC 582 ms
65,796 KB
testcase_12 AC 586 ms
65,712 KB
testcase_13 AC 586 ms
65,868 KB
testcase_14 AC 70 ms
50,768 KB
testcase_15 AC 69 ms
50,800 KB
testcase_16 AC 69 ms
50,960 KB
testcase_17 AC 69 ms
48,808 KB
testcase_18 AC 69 ms
48,540 KB
testcase_19 AC 70 ms
50,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    int m = ni();
    int[][] p = ntable(m, 3);

    int mod = (int) 1e9 + 7;
    int[][] fif = enumFIF(n + n, mod);

    long total = CX(n + n, n, mod, fif) * (n + n) % mod;

    for (int[] v : p) {
      int t = v[0];
      int x = v[1];
      int y = v[2];

      if (t == 1) {
        total += mod - CX(x + y, x, mod, fif) * CX((n - x - 1) + (n - y), (n - x - 1), mod, fif) % mod;
        total %= mod;
      } else {
        total += mod - CX(x + y, x, mod, fif) * CX((n - x) + (n - y - 1), (n - x), mod, fif) % mod;
        total %= mod;
      }
    }
    System.out.println(total);
  }

  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 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 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