結果

問題 No.184 たのしい排他的論理和(HARD)
ユーザー ぴろずぴろず
提出日時 2015-05-18 14:04:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 164 ms / 5,000 ms
コード長 4,199 bytes
コンパイル時間 2,388 ms
コンパイル使用メモリ 77,952 KB
実行使用メモリ 39,824 KB
最終ジャッジ日時 2024-07-04 11:52:39
合計ジャッジ時間 7,795 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,988 KB
testcase_01 AC 51 ms
36,480 KB
testcase_02 AC 53 ms
36,808 KB
testcase_03 AC 53 ms
37,044 KB
testcase_04 AC 52 ms
36,888 KB
testcase_05 AC 52 ms
36,760 KB
testcase_06 AC 54 ms
36,852 KB
testcase_07 AC 55 ms
37,048 KB
testcase_08 AC 142 ms
39,536 KB
testcase_09 AC 100 ms
38,348 KB
testcase_10 AC 133 ms
39,320 KB
testcase_11 AC 122 ms
39,136 KB
testcase_12 AC 153 ms
39,544 KB
testcase_13 AC 155 ms
39,452 KB
testcase_14 AC 131 ms
39,284 KB
testcase_15 AC 161 ms
39,412 KB
testcase_16 AC 148 ms
39,624 KB
testcase_17 AC 153 ms
39,736 KB
testcase_18 AC 52 ms
36,804 KB
testcase_19 AC 53 ms
36,816 KB
testcase_20 AC 116 ms
39,592 KB
testcase_21 AC 160 ms
39,644 KB
testcase_22 AC 164 ms
39,824 KB
testcase_23 AC 54 ms
36,524 KB
testcase_24 AC 55 ms
37,040 KB
testcase_25 AC 54 ms
36,828 KB
testcase_26 AC 55 ms
37,104 KB
testcase_27 AC 60 ms
36,860 KB
testcase_28 AC 143 ms
39,212 KB
testcase_29 AC 148 ms
39,604 KB
testcase_30 AC 147 ms
39,512 KB
testcase_31 AC 142 ms
39,576 KB
testcase_32 AC 148 ms
39,412 KB
testcase_33 AC 161 ms
39,572 KB
testcase_34 AC 159 ms
39,564 KB
testcase_35 AC 161 ms
39,792 KB
testcase_36 AC 156 ms
39,528 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no184a;

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

public class Main {
	static IO io = new IO();
	public static void main(String[] args) {
		int n = io.nextInt();
		long[] a = io.nextLongArray(n);
		int r = 0;
		for(int j=0;j<=60;j++) {
			int ind = -1;
			for(int i=r;i<n;i++) {
				if ((a[i] >> j & 1) == 1) {
					ind = i;
					break;
				}
			}
			if (ind == -1) {
				continue;
			}
			long temp = a[ind];
			a[ind] = a[r];
			a[r] = temp;
			for(int i=r+1;i<n;i++) {
				if ((a[i] >> j & 1) == 1) {
					a[i] ^= a[r];
				}
			}
			r++;
		}
		System.out.println(1L << r);
	}

}
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