結果
問題 | No.1493 隣接xor |
ユーザー | hiromi_ayase |
提出日時 | 2021-05-01 14:51:50 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,973 bytes |
コンパイル時間 | 2,187 ms |
コンパイル使用メモリ | 81,660 KB |
実行使用メモリ | 84,092 KB |
最終ジャッジ日時 | 2023-09-27 04:48:33 |
合計ジャッジ時間 | 12,390 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
50,868 KB |
testcase_01 | AC | 60 ms
51,012 KB |
testcase_02 | AC | 58 ms
50,868 KB |
testcase_03 | AC | 435 ms
76,180 KB |
testcase_04 | AC | 437 ms
76,108 KB |
testcase_05 | AC | 428 ms
75,836 KB |
testcase_06 | AC | 440 ms
76,240 KB |
testcase_07 | AC | 431 ms
76,420 KB |
testcase_08 | AC | 446 ms
76,076 KB |
testcase_09 | AC | 426 ms
76,444 KB |
testcase_10 | AC | 427 ms
75,604 KB |
testcase_11 | AC | 436 ms
76,516 KB |
testcase_12 | AC | 426 ms
76,812 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 60 ms
51,144 KB |
testcase_16 | AC | 60 ms
51,100 KB |
testcase_17 | AC | 59 ms
50,936 KB |
testcase_18 | AC | 61 ms
48,812 KB |
testcase_19 | AC | 61 ms
50,724 KB |
testcase_20 | AC | 330 ms
66,028 KB |
testcase_21 | AC | 332 ms
66,920 KB |
testcase_22 | AC | 283 ms
63,664 KB |
testcase_23 | AC | 328 ms
66,264 KB |
testcase_24 | AC | 419 ms
84,092 KB |
testcase_25 | AC | 273 ms
63,744 KB |
testcase_26 | AC | 332 ms
66,656 KB |
testcase_27 | AC | 245 ms
61,352 KB |
testcase_28 | AC | 395 ms
74,568 KB |
testcase_29 | AC | 333 ms
67,304 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int[] a = na(n); int mod = (int) 1e9 + 7; long[] dp = new long[n + 1]; long[] sdp = new long[n + 1]; dp[0] = sdp[0] = 1; Map<Integer, Integer> map = new HashMap<>(); int x = 0; for (int i = 0; i < n; i++) { x ^= a[i]; int from = map.getOrDefault(x, -1); dp[i + 1] = sdp[i] - (from >= 0 ? sdp[from] : 0) + mod; dp[i + 1] %= mod; sdp[i + 1] = dp[i + 1] + sdp[i]; sdp[i + 1] %= mod; map.put(x, i); } System.out.println(dp[n]); } 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)); } }