結果
問題 | No.1189 Sum is XOR |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-22 16:40:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 896 ms / 2,000 ms |
コード長 | 3,193 bytes |
コンパイル時間 | 2,821 ms |
コンパイル使用メモリ | 89,268 KB |
実行使用メモリ | 48,144 KB |
最終ジャッジ日時 | 2024-04-23 10:40:15 |
合計ジャッジ時間 | 14,168 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 889 ms
48,144 KB |
testcase_01 | AC | 894 ms
47,404 KB |
testcase_02 | AC | 896 ms
47,848 KB |
testcase_03 | AC | 205 ms
45,720 KB |
testcase_04 | AC | 194 ms
45,772 KB |
testcase_05 | AC | 228 ms
46,172 KB |
testcase_06 | AC | 217 ms
47,520 KB |
testcase_07 | AC | 217 ms
46,740 KB |
testcase_08 | AC | 160 ms
44,096 KB |
testcase_09 | AC | 158 ms
43,952 KB |
testcase_10 | AC | 149 ms
43,552 KB |
testcase_11 | AC | 329 ms
43,952 KB |
testcase_12 | AC | 882 ms
47,424 KB |
testcase_13 | AC | 786 ms
47,412 KB |
testcase_14 | AC | 579 ms
46,316 KB |
testcase_15 | AC | 329 ms
43,852 KB |
testcase_16 | AC | 242 ms
42,372 KB |
testcase_17 | AC | 329 ms
44,032 KB |
testcase_18 | AC | 432 ms
45,488 KB |
testcase_19 | AC | 713 ms
45,952 KB |
testcase_20 | AC | 698 ms
46,128 KB |
testcase_21 | AC | 68 ms
38,452 KB |
testcase_22 | AC | 69 ms
38,192 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int k = ni(); int[] a = na(n); int mod = 998244353; int max = 10; if (k > max) { System.out.println(0); return; } int[][] dp = new int[max + 1][1 << max]; dp[0][0] = 1; int mask = (1 << max) - 1; for (int i = 0; i < n; i++) { int y = ~a[i] & mask; int x = y; while (true) { for (int j = max - 1; j >= 0; j--) { dp[j + 1][x | a[i]] += dp[j][x]; dp[j + 1][x | a[i]] %= mod; } x--; if (x < 0) break; x &= y; } } int ret = 0; for (int i = 0; i < (1 << max); i++) { ret += dp[k][i]; ret %= mod; } // System.err.println(Arrays.toString(dp[k])); System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }