結果
問題 | No.389 ロジックパズルの組み合わせ |
ユーザー | uwi |
提出日時 | 2016-07-08 22:39:16 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 277 ms / 2,000 ms |
コード長 | 3,942 bytes |
コンパイル時間 | 3,739 ms |
コンパイル使用メモリ | 90,128 KB |
実行使用メモリ | 86,604 KB |
最終ジャッジ日時 | 2023-08-03 07:03:02 |
合計ジャッジ時間 | 19,988 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
58,164 KB |
testcase_01 | AC | 39 ms
49,276 KB |
testcase_02 | AC | 97 ms
58,048 KB |
testcase_03 | AC | 54 ms
50,548 KB |
testcase_04 | AC | 97 ms
58,076 KB |
testcase_05 | AC | 41 ms
49,528 KB |
testcase_06 | AC | 40 ms
49,052 KB |
testcase_07 | AC | 40 ms
49,124 KB |
testcase_08 | AC | 39 ms
49,044 KB |
testcase_09 | AC | 151 ms
61,700 KB |
testcase_10 | AC | 153 ms
61,372 KB |
testcase_11 | AC | 169 ms
63,128 KB |
testcase_12 | AC | 149 ms
60,864 KB |
testcase_13 | AC | 241 ms
64,672 KB |
testcase_14 | AC | 173 ms
62,856 KB |
testcase_15 | AC | 139 ms
59,332 KB |
testcase_16 | AC | 149 ms
61,152 KB |
testcase_17 | AC | 170 ms
62,436 KB |
testcase_18 | AC | 277 ms
82,560 KB |
testcase_19 | AC | 99 ms
58,156 KB |
testcase_20 | AC | 100 ms
58,120 KB |
testcase_21 | AC | 101 ms
58,136 KB |
testcase_22 | AC | 102 ms
57,832 KB |
testcase_23 | AC | 101 ms
58,116 KB |
testcase_24 | AC | 98 ms
58,136 KB |
testcase_25 | AC | 97 ms
58,148 KB |
testcase_26 | AC | 96 ms
58,308 KB |
testcase_27 | AC | 96 ms
58,176 KB |
testcase_28 | AC | 96 ms
58,252 KB |
testcase_29 | AC | 95 ms
57,976 KB |
testcase_30 | AC | 96 ms
58,456 KB |
testcase_31 | AC | 99 ms
58,132 KB |
testcase_32 | AC | 95 ms
57,972 KB |
testcase_33 | AC | 95 ms
57,956 KB |
testcase_34 | AC | 99 ms
58,172 KB |
testcase_35 | AC | 96 ms
58,144 KB |
testcase_36 | AC | 97 ms
58,180 KB |
testcase_37 | AC | 98 ms
57,984 KB |
testcase_38 | AC | 96 ms
58,116 KB |
testcase_39 | AC | 100 ms
58,396 KB |
testcase_40 | AC | 100 ms
57,988 KB |
testcase_41 | AC | 102 ms
58,136 KB |
testcase_42 | AC | 100 ms
58,032 KB |
testcase_43 | AC | 99 ms
56,476 KB |
testcase_44 | AC | 94 ms
58,128 KB |
testcase_45 | AC | 97 ms
57,980 KB |
testcase_46 | AC | 96 ms
58,176 KB |
testcase_47 | AC | 99 ms
58,188 KB |
testcase_48 | AC | 99 ms
58,224 KB |
testcase_49 | AC | 219 ms
78,752 KB |
testcase_50 | AC | 106 ms
52,632 KB |
testcase_51 | AC | 106 ms
52,924 KB |
testcase_52 | AC | 124 ms
57,504 KB |
testcase_53 | AC | 114 ms
54,528 KB |
testcase_54 | AC | 139 ms
58,176 KB |
testcase_55 | AC | 67 ms
51,588 KB |
testcase_56 | AC | 113 ms
55,028 KB |
testcase_57 | AC | 183 ms
62,624 KB |
testcase_58 | AC | 213 ms
71,664 KB |
testcase_59 | AC | 208 ms
67,500 KB |
testcase_60 | AC | 145 ms
58,092 KB |
testcase_61 | AC | 275 ms
86,604 KB |
testcase_62 | AC | 140 ms
58,356 KB |
testcase_63 | AC | 211 ms
72,020 KB |
testcase_64 | AC | 141 ms
58,356 KB |
testcase_65 | AC | 116 ms
55,036 KB |
testcase_66 | AC | 143 ms
58,092 KB |
testcase_67 | AC | 142 ms
57,892 KB |
testcase_68 | AC | 139 ms
58,192 KB |
testcase_69 | AC | 99 ms
58,164 KB |
testcase_70 | AC | 100 ms
58,148 KB |
testcase_71 | AC | 99 ms
57,900 KB |
testcase_72 | AC | 102 ms
58,136 KB |
testcase_73 | AC | 99 ms
58,132 KB |
testcase_74 | AC | 98 ms
57,908 KB |
testcase_75 | AC | 99 ms
58,232 KB |
testcase_76 | AC | 98 ms
58,064 KB |
testcase_77 | AC | 97 ms
58,064 KB |
testcase_78 | AC | 97 ms
58,172 KB |
testcase_79 | AC | 98 ms
58,144 KB |
testcase_80 | AC | 97 ms
58,048 KB |
testcase_81 | AC | 98 ms
58,140 KB |
testcase_82 | AC | 99 ms
58,396 KB |
testcase_83 | AC | 98 ms
55,936 KB |
testcase_84 | AC | 98 ms
58,160 KB |
testcase_85 | AC | 98 ms
57,988 KB |
testcase_86 | AC | 98 ms
58,184 KB |
testcase_87 | AC | 99 ms
58,128 KB |
testcase_88 | AC | 97 ms
58,040 KB |
testcase_89 | AC | 207 ms
63,340 KB |
testcase_90 | AC | 234 ms
65,436 KB |
testcase_91 | AC | 275 ms
82,144 KB |
testcase_92 | AC | 168 ms
62,608 KB |
testcase_93 | AC | 249 ms
74,496 KB |
testcase_94 | AC | 119 ms
58,828 KB |
testcase_95 | AC | 254 ms
75,352 KB |
testcase_96 | AC | 241 ms
65,020 KB |
testcase_97 | AC | 246 ms
65,476 KB |
testcase_98 | AC | 189 ms
63,292 KB |
ソースコード
package contest; 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 N389 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); String line = ns(); String[] sp = line.split(" "); int[] a = new int[sp.length]; for(int i = 0;i < sp.length;i++){ a[i] = Integer.parseInt(sp[i]); } if(a[0] == 0){ out.println(1); return; } int sum = n-(Arrays.stream(a).sum()+sp.length-1); if(sum < 0){ out.println("NA"); return; } int num = sp.length; int mod = 1000000007; int[][] fif = enumFIF(1000000, mod); out.println(C(sum+num,num,mod,fif)); } 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"); } public static void main(String[] args) throws Exception { new N389().run(); } private byte[] inbuf = new byte[1024]; private 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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }