結果
| 問題 | No.1202 お菓子の食べ方 |
| ユーザー |
 uwi
|
| 提出日時 | 2020-08-28 22:32:37 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 526 ms / 2,000 ms |
| コード長 | 4,770 bytes |
| コンパイル時間 | 4,116 ms |
| コンパイル使用メモリ | 87,976 KB |
| 実行使用メモリ | 62,620 KB |
| 最終ジャッジ日時 | 2024-11-14 01:24:43 |
| 合計ジャッジ時間 | 20,485 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 45 |
ソースコード
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)); }}