結果
問題 | No.1202 お菓子の食べ方 |
ユーザー | uwi |
提出日時 | 2020-08-28 22:32:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 533 ms / 2,000 ms |
コード長 | 4,770 bytes |
コンパイル時間 | 4,095 ms |
コンパイル使用メモリ | 81,204 KB |
実行使用メモリ | 52,936 KB |
最終ジャッジ日時 | 2024-04-26 13:28:36 |
合計ジャッジ時間 | 20,306 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 508 ms
52,620 KB |
testcase_01 | AC | 515 ms
52,860 KB |
testcase_02 | AC | 504 ms
52,692 KB |
testcase_03 | AC | 512 ms
52,536 KB |
testcase_04 | AC | 504 ms
52,876 KB |
testcase_05 | AC | 504 ms
52,740 KB |
testcase_06 | AC | 507 ms
52,596 KB |
testcase_07 | AC | 512 ms
52,832 KB |
testcase_08 | AC | 492 ms
52,936 KB |
testcase_09 | AC | 533 ms
52,812 KB |
testcase_10 | AC | 138 ms
46,488 KB |
testcase_11 | AC | 222 ms
48,224 KB |
testcase_12 | AC | 345 ms
49,716 KB |
testcase_13 | AC | 148 ms
47,128 KB |
testcase_14 | AC | 337 ms
49,488 KB |
testcase_15 | AC | 129 ms
46,056 KB |
testcase_16 | AC | 279 ms
48,856 KB |
testcase_17 | AC | 234 ms
48,128 KB |
testcase_18 | AC | 220 ms
47,984 KB |
testcase_19 | AC | 151 ms
46,928 KB |
testcase_20 | AC | 302 ms
48,948 KB |
testcase_21 | AC | 308 ms
49,256 KB |
testcase_22 | AC | 169 ms
47,204 KB |
testcase_23 | AC | 269 ms
48,744 KB |
testcase_24 | AC | 265 ms
48,872 KB |
testcase_25 | AC | 150 ms
46,856 KB |
testcase_26 | AC | 319 ms
49,504 KB |
testcase_27 | AC | 282 ms
49,160 KB |
testcase_28 | AC | 204 ms
48,052 KB |
testcase_29 | AC | 230 ms
48,176 KB |
testcase_30 | AC | 98 ms
45,632 KB |
testcase_31 | AC | 101 ms
45,548 KB |
testcase_32 | AC | 98 ms
45,676 KB |
testcase_33 | AC | 97 ms
45,672 KB |
testcase_34 | AC | 97 ms
45,564 KB |
testcase_35 | AC | 97 ms
45,516 KB |
testcase_36 | AC | 100 ms
45,568 KB |
testcase_37 | AC | 100 ms
45,540 KB |
testcase_38 | AC | 98 ms
45,388 KB |
testcase_39 | AC | 100 ms
45,300 KB |
testcase_40 | AC | 505 ms
52,520 KB |
testcase_41 | AC | 506 ms
52,728 KB |
testcase_42 | AC | 495 ms
52,844 KB |
testcase_43 | AC | 504 ms
52,596 KB |
testcase_44 | AC | 517 ms
52,424 KB |
ソースコード
package contest200828; 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 E2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[][] a = new int[n][]; for(int i = 0;i < n;i++){ a[i] = na(m); } int mod = 1000000007; int[][] fif = enumFIF(1003005, mod); long ans = 0; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ int v = a[i][j]; ans += C(i+j+v-1, i, mod, fif) * C(j+v-1, j, mod, fif); ans %= mod; } } for(int k = 1;k <= m;k++){ long s = 0; for(int i = 0;i < n;i++){ int inf = (k == m ? 0 : a[i][k]); long t = C(i+k-1+a[i][k-1], a[i][k-1]-1, mod, fif) - C(i+k-1+inf, inf-1, mod, fif); t *= C(i+k-1, k-1, mod, fif); t %= mod; if(t < 0)t += mod; s += t; } ans += s; ans %= mod; } for(int k = 1;k <= n;k++){ long s = 0; for(int i = 0;i < m;i++){ int inf = (k == n ? 0 : a[k][i]); long t = C(i+k-1+a[k-1][i], a[k-1][i]-1, mod, fif) - C(i+k-1+inf, inf-1, mod, fif); t *= C(i+k-1, k-1, mod, fif); t %= mod; if(t < 0)t += mod; s += t; } ans += s; 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 E2().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)); } }