結果

問題 No.1493 隣接xor
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-07-26 18:40:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 789 ms / 2,000 ms
コード長 3,700 bytes
コンパイル時間 4,383 ms
コンパイル使用メモリ 80,564 KB
実行使用メモリ 97,296 KB
最終ジャッジ日時 2024-07-22 09:43:24
合計ジャッジ時間 20,167 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,036 KB
testcase_01 AC 54 ms
36,776 KB
testcase_02 AC 53 ms
36,724 KB
testcase_03 AC 717 ms
96,924 KB
testcase_04 AC 726 ms
97,172 KB
testcase_05 AC 730 ms
96,840 KB
testcase_06 AC 713 ms
97,156 KB
testcase_07 AC 721 ms
97,280 KB
testcase_08 AC 766 ms
97,220 KB
testcase_09 AC 733 ms
97,220 KB
testcase_10 AC 789 ms
95,200 KB
testcase_11 AC 748 ms
97,296 KB
testcase_12 AC 719 ms
96,788 KB
testcase_13 AC 366 ms
62,784 KB
testcase_14 AC 307 ms
57,400 KB
testcase_15 AC 54 ms
36,528 KB
testcase_16 AC 53 ms
36,868 KB
testcase_17 AC 55 ms
36,940 KB
testcase_18 AC 55 ms
36,872 KB
testcase_19 AC 53 ms
36,860 KB
testcase_20 AC 481 ms
70,008 KB
testcase_21 AC 598 ms
76,440 KB
testcase_22 AC 384 ms
64,584 KB
testcase_23 AC 461 ms
68,812 KB
testcase_24 AC 753 ms
95,536 KB
testcase_25 AC 358 ms
59,556 KB
testcase_26 AC 619 ms
77,452 KB
testcase_27 AC 329 ms
54,492 KB
testcase_28 AC 594 ms
84,104 KB
testcase_29 AC 607 ms
76,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
		}
	}
}
0