結果
問題 | No.1493 隣接xor |
ユーザー | cyclerecycle9 |
提出日時 | 2021-07-26 18:40:27 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 623 ms / 2,000 ms |
コード長 | 3,700 bytes |
コンパイル時間 | 2,753 ms |
コンパイル使用メモリ | 77,968 KB |
実行使用メモリ | 109,820 KB |
最終ジャッジ日時 | 2023-09-29 15:33:45 |
合計ジャッジ時間 | 18,420 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,332 KB |
testcase_01 | AC | 42 ms
49,676 KB |
testcase_02 | AC | 42 ms
49,448 KB |
testcase_03 | AC | 623 ms
109,412 KB |
testcase_04 | AC | 610 ms
109,548 KB |
testcase_05 | AC | 578 ms
109,604 KB |
testcase_06 | AC | 611 ms
109,516 KB |
testcase_07 | AC | 598 ms
109,820 KB |
testcase_08 | AC | 612 ms
109,536 KB |
testcase_09 | AC | 590 ms
109,592 KB |
testcase_10 | AC | 606 ms
109,292 KB |
testcase_11 | AC | 596 ms
109,580 KB |
testcase_12 | AC | 577 ms
109,552 KB |
testcase_13 | AC | 316 ms
74,856 KB |
testcase_14 | AC | 270 ms
69,616 KB |
testcase_15 | AC | 41 ms
49,472 KB |
testcase_16 | AC | 42 ms
49,660 KB |
testcase_17 | AC | 42 ms
49,384 KB |
testcase_18 | AC | 42 ms
49,544 KB |
testcase_19 | AC | 42 ms
49,524 KB |
testcase_20 | AC | 370 ms
79,300 KB |
testcase_21 | AC | 474 ms
84,220 KB |
testcase_22 | AC | 301 ms
70,048 KB |
testcase_23 | AC | 378 ms
79,040 KB |
testcase_24 | AC | 597 ms
108,028 KB |
testcase_25 | AC | 295 ms
70,580 KB |
testcase_26 | AC | 492 ms
88,188 KB |
testcase_27 | AC | 262 ms
65,584 KB |
testcase_28 | AC | 559 ms
107,364 KB |
testcase_29 | AC | 489 ms
85,584 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.math.RoundingMode; import java.util.*; public class Main { static final long MOD=1000000007; static final long MOD1=998244353; static int ans=0; public static void main(String[] args){ PrintWriter out = new PrintWriter(System.out); InputReader sc=new InputReader(System.in); int N = sc.nextInt(); long[] A = sc.nextLongArray(N); HashMap<Long, TreeSet<Integer>> hashMap = new HashMap<>(); hashMap.put(A[0], new TreeSet<>()); hashMap.get(A[0]).add(1); for (int i = 1; i < A.length; i++) { A[i] ^= A[i-1]; if (!hashMap.containsKey(A[i]))hashMap.put(A[i], new TreeSet<>()); hashMap.get(A[i]).add(i+1); } long[] dp = new long[N]; dp[0] = 1l; for (int i = 1; i < dp.length; i++) { dp[i] = (2*dp[i-1])%MOD; Integer k = hashMap.get(A[i-1]).lower(i); if (k!=null) { dp[i] = (dp[i] - dp[k-1] + MOD)%MOD; } } System.out.println(dp[N-1]); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } }