結果
問題 | No.1785 Inequality Signs |
ユーザー | hiromi_ayase |
提出日時 | 2021-12-14 05:49:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 419 ms / 2,000 ms |
コード長 | 5,143 bytes |
コンパイル時間 | 3,134 ms |
コンパイル使用メモリ | 79,572 KB |
実行使用メモリ | 58,252 KB |
最終ジャッジ日時 | 2023-09-30 12:31:57 |
合計ジャッジ時間 | 19,284 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
54,472 KB |
testcase_01 | AC | 156 ms
54,992 KB |
testcase_02 | AC | 340 ms
57,708 KB |
testcase_03 | AC | 412 ms
57,836 KB |
testcase_04 | AC | 99 ms
54,812 KB |
testcase_05 | AC | 249 ms
58,248 KB |
testcase_06 | AC | 382 ms
57,732 KB |
testcase_07 | AC | 108 ms
54,764 KB |
testcase_08 | AC | 372 ms
57,708 KB |
testcase_09 | AC | 153 ms
54,876 KB |
testcase_10 | AC | 306 ms
57,996 KB |
testcase_11 | AC | 174 ms
55,520 KB |
testcase_12 | AC | 231 ms
57,616 KB |
testcase_13 | AC | 149 ms
54,840 KB |
testcase_14 | AC | 264 ms
57,888 KB |
testcase_15 | AC | 240 ms
57,476 KB |
testcase_16 | AC | 211 ms
58,252 KB |
testcase_17 | AC | 309 ms
57,492 KB |
testcase_18 | AC | 310 ms
57,872 KB |
testcase_19 | AC | 271 ms
57,472 KB |
testcase_20 | AC | 290 ms
57,572 KB |
testcase_21 | AC | 272 ms
57,472 KB |
testcase_22 | AC | 159 ms
54,564 KB |
testcase_23 | AC | 211 ms
58,132 KB |
testcase_24 | AC | 407 ms
57,516 KB |
testcase_25 | AC | 241 ms
57,896 KB |
testcase_26 | AC | 238 ms
57,588 KB |
testcase_27 | AC | 417 ms
57,800 KB |
testcase_28 | AC | 419 ms
57,908 KB |
testcase_29 | AC | 417 ms
57,908 KB |
testcase_30 | AC | 419 ms
57,648 KB |
testcase_31 | AC | 419 ms
57,692 KB |
testcase_32 | AC | 418 ms
57,788 KB |
testcase_33 | AC | 92 ms
54,388 KB |
testcase_34 | AC | 113 ms
52,648 KB |
testcase_35 | AC | 132 ms
54,556 KB |
testcase_36 | AC | 334 ms
57,680 KB |
testcase_37 | AC | 297 ms
57,992 KB |
testcase_38 | AC | 276 ms
57,908 KB |
testcase_39 | AC | 171 ms
55,400 KB |
testcase_40 | AC | 208 ms
55,640 KB |
testcase_41 | AC | 247 ms
57,700 KB |
testcase_42 | AC | 366 ms
57,476 KB |
testcase_43 | AC | 399 ms
57,540 KB |
testcase_44 | AC | 358 ms
57,828 KB |
testcase_45 | AC | 197 ms
57,764 KB |
testcase_46 | AC | 275 ms
57,712 KB |
testcase_47 | AC | 225 ms
57,748 KB |
testcase_48 | AC | 274 ms
57,532 KB |
testcase_49 | AC | 109 ms
54,480 KB |
testcase_50 | AC | 351 ms
57,848 KB |
testcase_51 | AC | 128 ms
54,816 KB |
testcase_52 | AC | 117 ms
54,844 KB |
testcase_53 | AC | 137 ms
54,600 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni() - 1; int k = ni() - 1; System.out.println(solve(n, k)); } private static long solve(int n, int k) { long sa = 1; for (int i = k + 1, j = 1; i <= n + k + 1; i++, j ++) { sa *= i; sa %= mod; sa *= inv(j, mod); sa %= mod; } long[] a = new long[n + 1]; a[0] = combNative(n + k, n); long sa2 = a[0]; for (int i = 0; i < n; i++) { int x = n + k - i; int y = x - n; a[i + 1] = y >= 0 ? a[i] * y % mod * inv(x, mod) % mod : 0; sa2 += a[i + 1]; } long sb = pow(2, n, mod); long[] b = new long[n + 1]; for (int i = 0; i <= n; i++) { b[i] = CX(n, i, mod, fif); } long ans = sa * sb % mod; for (int i = 0; i < n; i++) { sa2 += mod - a[n - i]; sa2 %= mod; ans += mod - sa2 * b[i] % mod; ans %= mod; } return ans; } public static long inv(long a, int p) { long ret = 1; long mul = a; for (long n = p - 2; n > 0; n >>>= 1) { if ((n & 1) == 1) ret = ret * mul % p; mul = mul * mul % p; } return ret; } private static long combNative(long n, int r) { long x = 1; long y = 1; for (int i = 0; i < r; i++) { x *= n - i; x %= mod; y *= i + 1; y %= mod; } return x * pow(y, mod - 2, mod) % mod; } private static long pow(long x, long n, int m) { if (m == 1) return 0; long r = 1; long y = x % m; while (n > 0) { if ((n & 1) != 0) r = (r * y) % m; y = (y * y) % m; n >>= 1; } return r; } private static int mod = 1000000007; private static int[][] fif = enumFIF(300000, mod); 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)); } }