結果

問題 No.184 たのしい排他的論理和(HARD)
ユーザー ぴろずぴろず
提出日時 2015-04-16 23:48:02
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,244 bytes
コンパイル時間 4,469 ms
コンパイル使用メモリ 78,592 KB
実行使用メモリ 57,436 KB
最終ジャッジ日時 2024-07-04 11:11:48
合計ジャッジ時間 24,256 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,448 KB
testcase_01 AC 51 ms
50,048 KB
testcase_02 AC 52 ms
50,496 KB
testcase_03 RE -
testcase_04 AC 51 ms
50,388 KB
testcase_05 AC 52 ms
50,460 KB
testcase_06 RE -
testcase_07 AC 51 ms
50,456 KB
testcase_08 AC 840 ms
57,076 KB
testcase_09 AC 304 ms
56,048 KB
testcase_10 AC 676 ms
57,228 KB
testcase_11 AC 541 ms
57,152 KB
testcase_12 AC 933 ms
57,064 KB
testcase_13 AC 892 ms
57,260 KB
testcase_14 AC 735 ms
57,152 KB
testcase_15 AC 1,007 ms
56,980 KB
testcase_16 AC 865 ms
57,056 KB
testcase_17 AC 901 ms
57,120 KB
testcase_18 AC 53 ms
50,580 KB
testcase_19 AC 54 ms
50,480 KB
testcase_20 AC 140 ms
53,744 KB
testcase_21 AC 990 ms
56,956 KB
testcase_22 AC 1,071 ms
57,340 KB
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 AC 730 ms
56,800 KB
testcase_29 AC 1,054 ms
57,436 KB
testcase_30 AC 906 ms
56,956 KB
testcase_31 AC 800 ms
57,140 KB
testcase_32 AC 852 ms
56,880 KB
testcase_33 AC 1,027 ms
56,948 KB
testcase_34 AC 1,021 ms
57,124 KB
testcase_35 AC 1,022 ms
56,916 KB
testcase_36 AC 1,086 ms
57,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no184;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		long[] a = io.nextLongArray(n);
		int used = 0;
		for(int i=60;i>=0;i--) {
			Arrays.sort(a);
			if ((a[n-1-used] >> i & 1) == 1) {
				for(int j=0;j<n-1-used;j++) {
					if ((a[j] >> i & 1) == 1) {
						a[j] ^= a[n-1-used];
					}
				}
				used++;
			}
//			System.out.println(i + ":" + Arrays.toString(a));
		}
		long nonzero = 0;
		for(int i=0;i<n;i++) {
			if (a[i] != 0) {
				nonzero++;
			}
		}
		System.out.println(1L << nonzero);
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	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 long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); 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 void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0