結果
問題 | No.462 6日知らずのコンピュータ |
ユーザー | 37zigen |
提出日時 | 2016-12-13 17:58:12 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,630 bytes |
コンパイル時間 | 3,796 ms |
コンパイル使用メモリ | 77,632 KB |
実行使用メモリ | 41,784 KB |
最終ジャッジ日時 | 2024-11-30 01:12:18 |
合計ジャッジ時間 | 18,113 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
40,780 KB |
testcase_01 | AC | 129 ms
41,328 KB |
testcase_02 | AC | 147 ms
41,140 KB |
testcase_03 | AC | 140 ms
41,452 KB |
testcase_04 | AC | 127 ms
41,064 KB |
testcase_05 | AC | 130 ms
41,156 KB |
testcase_06 | WA | - |
testcase_07 | AC | 134 ms
41,200 KB |
testcase_08 | AC | 128 ms
41,180 KB |
testcase_09 | AC | 127 ms
41,288 KB |
testcase_10 | AC | 128 ms
41,020 KB |
testcase_11 | AC | 127 ms
41,256 KB |
testcase_12 | AC | 131 ms
41,324 KB |
testcase_13 | AC | 134 ms
41,108 KB |
testcase_14 | AC | 138 ms
41,088 KB |
testcase_15 | AC | 133 ms
41,176 KB |
testcase_16 | AC | 134 ms
41,232 KB |
testcase_17 | AC | 133 ms
41,588 KB |
testcase_18 | AC | 132 ms
41,132 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 129 ms
41,316 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | AC | 135 ms
41,212 KB |
testcase_50 | AC | 129 ms
41,328 KB |
testcase_51 | AC | 127 ms
41,124 KB |
testcase_52 | AC | 123 ms
40,220 KB |
testcase_53 | AC | 130 ms
41,176 KB |
testcase_54 | AC | 131 ms
41,524 KB |
testcase_55 | AC | 130 ms
41,344 KB |
testcase_56 | AC | 134 ms
41,436 KB |
testcase_57 | AC | 137 ms
41,364 KB |
testcase_58 | AC | 131 ms
41,468 KB |
testcase_59 | AC | 136 ms
41,248 KB |
testcase_60 | AC | 134 ms
41,212 KB |
testcase_61 | AC | 129 ms
41,516 KB |
testcase_62 | AC | 128 ms
41,444 KB |
testcase_63 | AC | 138 ms
41,228 KB |
testcase_64 | AC | 133 ms
41,200 KB |
testcase_65 | AC | 131 ms
41,484 KB |
testcase_66 | AC | 136 ms
41,384 KB |
testcase_67 | AC | 136 ms
41,380 KB |
testcase_68 | AC | 137 ms
41,160 KB |
testcase_69 | AC | 135 ms
41,264 KB |
testcase_70 | AC | 139 ms
41,144 KB |
testcase_71 | AC | 138 ms
41,056 KB |
testcase_72 | AC | 133 ms
41,392 KB |
testcase_73 | AC | 135 ms
41,236 KB |
testcase_74 | AC | 133 ms
40,900 KB |
testcase_75 | AC | 146 ms
41,116 KB |
testcase_76 | AC | 129 ms
41,140 KB |
testcase_77 | AC | 134 ms
41,040 KB |
testcase_78 | AC | 139 ms
41,004 KB |
testcase_79 | AC | 129 ms
41,444 KB |
testcase_80 | AC | 130 ms
41,388 KB |
testcase_81 | AC | 130 ms
41,224 KB |
testcase_82 | AC | 127 ms
41,184 KB |
testcase_83 | AC | 128 ms
41,156 KB |
testcase_84 | AC | 132 ms
41,392 KB |
testcase_85 | AC | 132 ms
41,416 KB |
testcase_86 | AC | 130 ms
41,308 KB |
ソースコード
package yukicoder; import java.util.*; public class Q462 { final static long MODULO = 1_000_000_000 + 7; public static void main(String[] args) { long[] fac = new long[100]; long[] invfac = new long[100]; fac[0] = 1; for (int i = 1; i < 100; ++i) { fac[i] = fac[i - 1] * i % MODULO; } invfac[invfac.length - 1] = pow(fac[fac.length - 1], MODULO - 2); for (int i = invfac.length - 2; i >= 0; --i) { invfac[i] = invfac[i + 1] * (i + 1) % MODULO; } long[][] dp = new long[100][100]; dp[0][0] = 1; for (int i = 1; i < 100; ++i) { for (int j = 0; j <= i; ++j) { if (j > 0) dp[i][j] = dp[i - 1][j - 1] * j % MODULO; if (j <= i - 1) dp[i][j] += dp[i - 1][j] * (j + 1) % MODULO; dp[i][j] %= MODULO; } } long[][] dp3 = new long[100][100]; dp3[1][0] = 1; for (int i = 2; i < 100; ++i) { for (int j = 0; j <= i; ++j) { if (j > 0) dp3[i][j] = dp3[i - 1][j - 1] * j % MODULO; if (j <= i - 1) { dp3[i][j] += (dp3[i - 1][j] * j + dp[i - 1][j]) % MODULO; } dp3[i][j] %= MODULO; } } dp3[0][0] = 1; Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int k = sc.nextInt(); if (k == 0) { System.out.println(dp[n][n] % MODULO); return; } long[] a = new long[k]; long[] diff = new long[k + 1]; for (int i = 0; i < k; ++i) { a[i] = sc.nextLong(); } for (int i = 0; i + 1 < k; ++i) { diff[i + 1] = count(a[i], a[i + 1]); if (diff[i + 1] < 0) { System.out.println(0); return; } } diff[0] = count(0, a[0]); diff[k] = count(a[k - 1], (1L << n) - 1); long[] dp1 = new long[n + 1]; dp1[0] = 1; if (a[0] != 0) dp1[1] = 1; for (int i = 0; i < k + 1; ++i) { for (int j = n; j >= 1; --j) { boolean f = false; if ((a[k - 1] != (1L << n) - 1 && i == k)) f = true; for (int l = 1; l <= diff[i] + (f ? 0 : -1) && j - l >= 0; ++l) { if (f && l == diff[i]) { dp1[j] += dp1[j - l] * dp[(int) diff[i]][l] % MODULO; } else dp1[j] += dp1[j - l] * dp3[(int) diff[i]][l] % MODULO; dp1[j] %= MODULO; } } } System.out.println(dp1[n + 1 - k]); } static long count(long min, long max) { for (int i = 0; i < 60; ++i) { if ((min & (1L << i)) > 0 && (max & (1L << i)) == 0) { return -1; } } int diff = Long.bitCount(max) - Long.bitCount(min); return diff; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } static long pow(long a, long n) { long ret = 1; for (; n > 0; n >>= 1, a = (a * a) % MODULO) { if (n % 2 == 1) ret = (ret * a) % MODULO; } return ret; } }