結果

問題 No.183 たのしい排他的論理和(EASY)
ユーザー tutuztutuz
提出日時 2018-09-17 06:58:02
言語 Java19
(openjdk 21)
結果
AC  
実行時間 372 ms / 5,000 ms
コード長 3,103 bytes
コンパイル時間 2,327 ms
コンパイル使用メモリ 74,464 KB
実行使用メモリ 53,476 KB
最終ジャッジ日時 2023-09-13 20:08:35
合計ジャッジ時間 6,600 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
49,460 KB
testcase_01 AC 49 ms
49,964 KB
testcase_02 AC 51 ms
49,596 KB
testcase_03 AC 52 ms
49,468 KB
testcase_04 AC 48 ms
49,592 KB
testcase_05 AC 57 ms
51,180 KB
testcase_06 AC 51 ms
49,588 KB
testcase_07 AC 308 ms
52,512 KB
testcase_08 AC 339 ms
52,260 KB
testcase_09 AC 248 ms
52,424 KB
testcase_10 AC 297 ms
52,824 KB
testcase_11 AC 362 ms
52,432 KB
testcase_12 AC 69 ms
51,400 KB
testcase_13 AC 46 ms
49,792 KB
testcase_14 AC 203 ms
52,252 KB
testcase_15 AC 372 ms
52,884 KB
testcase_16 AC 52 ms
49,572 KB
testcase_17 AC 144 ms
52,724 KB
testcase_18 AC 283 ms
52,400 KB
testcase_19 AC 95 ms
53,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		int max = 1 << 15;
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			int[] a = in.nextIntArray(n);

			long x = 0;
			boolean[] dp = new boolean[max];
			dp[0] = true;

			for (int i = 0; i < n; i++) {
				for (int j = 0; j < max; j++) {
					if (dp[j]) dp[j^a[i]] = true;
				}
			}

			long ans = 0;
			for (boolean b : dp) {
				if (b) ans++;
			}
			out.println(ans);

		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0