結果

問題 No.184 たのしい排他的論理和(HARD)
ユーザー tutuztutuz
提出日時 2018-10-07 21:27:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 307 ms / 5,000 ms
コード長 3,172 bytes
コンパイル時間 3,543 ms
コンパイル使用メモリ 74,388 KB
実行使用メモリ 58,260 KB
最終ジャッジ日時 2023-09-17 17:46:30
合計ジャッジ時間 10,629 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
33,620 KB
testcase_01 AC 40 ms
33,628 KB
testcase_02 AC 42 ms
34,164 KB
testcase_03 AC 41 ms
33,704 KB
testcase_04 AC 41 ms
33,736 KB
testcase_05 AC 40 ms
33,784 KB
testcase_06 AC 40 ms
33,964 KB
testcase_07 AC 41 ms
33,716 KB
testcase_08 AC 288 ms
44,196 KB
testcase_09 AC 162 ms
39,244 KB
testcase_10 AC 262 ms
43,328 KB
testcase_11 AC 218 ms
42,056 KB
testcase_12 AC 299 ms
45,644 KB
testcase_13 AC 299 ms
44,948 KB
testcase_14 AC 245 ms
42,136 KB
testcase_15 AC 298 ms
47,648 KB
testcase_16 AC 287 ms
44,028 KB
testcase_17 AC 293 ms
45,232 KB
testcase_18 AC 41 ms
33,772 KB
testcase_19 AC 40 ms
33,724 KB
testcase_20 AC 208 ms
41,980 KB
testcase_21 AC 304 ms
47,924 KB
testcase_22 AC 304 ms
47,376 KB
testcase_23 AC 43 ms
33,892 KB
testcase_24 AC 41 ms
33,592 KB
testcase_25 AC 42 ms
33,784 KB
testcase_26 AC 40 ms
33,792 KB
testcase_27 AC 41 ms
33,772 KB
testcase_28 AC 273 ms
43,788 KB
testcase_29 AC 298 ms
45,132 KB
testcase_30 AC 288 ms
44,212 KB
testcase_31 AC 272 ms
43,456 KB
testcase_32 AC 294 ms
44,368 KB
testcase_33 AC 304 ms
47,468 KB
testcase_34 AC 307 ms
48,040 KB
testcase_35 AC 300 ms
58,260 KB
testcase_36 AC 303 ms
47,496 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 {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

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

			int r = 0;
			for (int i = 0; i < 64; i++) {
				int j = r;
				for (; j < n; j++) {
					if ((a[j] >> i & 1) == 1) break;
				}

				if (j != n) {
					long tmp = a[j];
					a[j] = a[r];
					a[r] = tmp;
					for (int k = r+1; k < n; k++) {
						if ((a[k] >> i & 1) == 1) {
							a[k] ^= a[r];
						}
					}
					r++;
				}
			}
			out.println(1L << r);

		}
	}

	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