結果
問題 | No.462 6日知らずのコンピュータ |
ユーザー |
|
提出日時 | 2016-12-13 18:20:47 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,865 bytes |
コンパイル時間 | 3,884 ms |
コンパイル使用メモリ | 78,244 KB |
実行使用メモリ | 41,688 KB |
最終ジャッジ日時 | 2024-11-30 01:14:49 |
合計ジャッジ時間 | 15,833 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
41,144 KB |
testcase_01 | AC | 111 ms
41,264 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | WA | - |
testcase_07 | AC | 120 ms
41,384 KB |
testcase_08 | AC | 118 ms
41,360 KB |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | AC | 121 ms
41,416 KB |
testcase_12 | AC | 121 ms
41,428 KB |
testcase_13 | RE | - |
testcase_14 | AC | 124 ms
41,440 KB |
testcase_15 | AC | 119 ms
41,296 KB |
testcase_16 | AC | 107 ms
40,276 KB |
testcase_17 | AC | 123 ms
41,164 KB |
testcase_18 | RE | - |
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 | 123 ms
41,152 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 | 121 ms
41,428 KB |
testcase_50 | AC | 116 ms
41,380 KB |
testcase_51 | AC | 119 ms
41,188 KB |
testcase_52 | AC | 123 ms
40,912 KB |
testcase_53 | AC | 121 ms
41,168 KB |
testcase_54 | AC | 109 ms
40,344 KB |
testcase_55 | AC | 121 ms
41,500 KB |
testcase_56 | AC | 121 ms
41,408 KB |
testcase_57 | AC | 124 ms
41,592 KB |
testcase_58 | AC | 120 ms
41,596 KB |
testcase_59 | AC | 122 ms
41,068 KB |
testcase_60 | AC | 123 ms
41,396 KB |
testcase_61 | AC | 115 ms
41,360 KB |
testcase_62 | AC | 126 ms
41,592 KB |
testcase_63 | AC | 121 ms
40,880 KB |
testcase_64 | AC | 104 ms
40,396 KB |
testcase_65 | AC | 118 ms
41,292 KB |
testcase_66 | AC | 108 ms
40,408 KB |
testcase_67 | AC | 126 ms
41,156 KB |
testcase_68 | AC | 111 ms
40,416 KB |
testcase_69 | AC | 116 ms
40,792 KB |
testcase_70 | AC | 107 ms
39,984 KB |
testcase_71 | AC | 128 ms
41,540 KB |
testcase_72 | AC | 117 ms
41,164 KB |
testcase_73 | AC | 120 ms
41,512 KB |
testcase_74 | AC | 112 ms
41,312 KB |
testcase_75 | AC | 110 ms
40,484 KB |
testcase_76 | AC | 115 ms
41,016 KB |
testcase_77 | AC | 126 ms
41,492 KB |
testcase_78 | AC | 108 ms
40,568 KB |
testcase_79 | AC | 122 ms
41,172 KB |
testcase_80 | AC | 118 ms
41,340 KB |
testcase_81 | AC | 120 ms
41,448 KB |
testcase_82 | AC | 117 ms
41,384 KB |
testcase_83 | AC | 118 ms
41,304 KB |
testcase_84 | AC | 121 ms
41,436 KB |
testcase_85 | AC | 121 ms
41,312 KB |
testcase_86 | AC | 105 ms
40,352 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[][] 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; } } // 10,1111 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 ans = 1; for (int i = 0; i < k + 1; ++i) { if (i == k && a[k - 1] != (1L << n) - 1) { ans = (ans * dp[(int) diff[i]][(int) diff[i]]) % MODULO; } else { ans = (ans * dp3[(int) diff[i]][(int) diff[i] - 1]) % MODULO; } } System.out.println(ans); } 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)); } }