結果
問題 | No.802 だいたい等差数列 |
ユーザー | uwi |
提出日時 | 2019-03-18 22:18:30 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 170 ms / 2,000 ms |
コード長 | 4,569 bytes |
コンパイル時間 | 5,055 ms |
コンパイル使用メモリ | 77,148 KB |
実行使用メモリ | 65,204 KB |
最終ジャッジ日時 | 2023-09-26 12:03:44 |
合計ジャッジ時間 | 10,259 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
64,468 KB |
testcase_01 | AC | 109 ms
64,540 KB |
testcase_02 | AC | 109 ms
64,696 KB |
testcase_03 | AC | 43 ms
49,320 KB |
testcase_04 | AC | 108 ms
64,588 KB |
testcase_05 | AC | 41 ms
49,372 KB |
testcase_06 | AC | 109 ms
64,384 KB |
testcase_07 | AC | 108 ms
64,520 KB |
testcase_08 | AC | 108 ms
64,836 KB |
testcase_09 | AC | 107 ms
64,600 KB |
testcase_10 | AC | 108 ms
64,792 KB |
testcase_11 | AC | 109 ms
64,500 KB |
testcase_12 | AC | 110 ms
64,520 KB |
testcase_13 | AC | 110 ms
64,464 KB |
testcase_14 | AC | 117 ms
64,728 KB |
testcase_15 | AC | 135 ms
64,864 KB |
testcase_16 | AC | 114 ms
64,548 KB |
testcase_17 | AC | 43 ms
49,200 KB |
testcase_18 | AC | 43 ms
49,196 KB |
testcase_19 | AC | 115 ms
64,508 KB |
testcase_20 | AC | 160 ms
64,688 KB |
testcase_21 | AC | 153 ms
64,860 KB |
testcase_22 | AC | 109 ms
64,504 KB |
testcase_23 | AC | 123 ms
62,452 KB |
testcase_24 | AC | 43 ms
49,380 KB |
testcase_25 | AC | 108 ms
64,504 KB |
testcase_26 | AC | 108 ms
62,508 KB |
testcase_27 | AC | 108 ms
64,384 KB |
testcase_28 | AC | 123 ms
64,568 KB |
testcase_29 | AC | 170 ms
65,204 KB |
testcase_30 | AC | 108 ms
64,516 KB |
testcase_31 | AC | 107 ms
64,548 KB |
testcase_32 | AC | 42 ms
49,328 KB |
testcase_33 | AC | 113 ms
64,904 KB |
ソースコード
package contest190317; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D4 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int m = ni(); int d1 = ni(), d2 = ni(); int mod = 1000000007; if(m - (long)d1*(n-1) < 0) { out.println(0); return; } m -= (long)d1*(n-1); d2 -= d1; // (x^m-1)*(x^t-1)^{n-1}/(x-1)^n // k(d2+1)項目の寄与 : C(n-1,k)*(C(n-2,0)+C(n-1,1)+C(n,2)+...+C(n-2+(m-1-k(d2+1)),m-1-k(d2+1))+(C(n-2,0)+C(n-1,1)+C(n,2)+...+C(n-2+(m-2-k(d2+1)),m-2-k(d2+1)) // k(d2+1)項目の寄与 : C(n-1,k)*(C(n-1+(m-1-k(d2+1)),m-1-k(d2+1))+C(n-1+(m-2-k(d2+1)),m-2-k(d2+1))+... // k(d2+1)項目の寄与 : C(n-1,k)*(C(n-1+(m-1-k(d2+1))+1,m-1-k(d2+1)) int[][] fif = enumFIF(1300005, mod); long ans = 0; for(int i = (m-1)/(d2+1);i >= 0;i--) { ans = -ans + C(n+(m-1-i*(d2+1)), m-1-i*(d2+1), mod, fif)*C(n-1, i, mod, fif); ans %= mod; } if(ans < 0)ans += mod; out.println(ans); } 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 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 }; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D4().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }