結果

問題 No.184 たのしい排他的論理和(HARD)
ユーザー ぴろずぴろず
提出日時 2015-05-18 13:49:03
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,199 bytes
コンパイル時間 2,092 ms
コンパイル使用メモリ 79,004 KB
実行使用メモリ 150,852 KB
最終ジャッジ日時 2024-07-04 11:49:31
合計ジャッジ時間 9,257 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
50,052 KB
testcase_01 AC 52 ms
50,216 KB
testcase_02 AC 52 ms
50,180 KB
testcase_03 WA -
testcase_04 AC 50 ms
50,272 KB
testcase_05 AC 54 ms
49,912 KB
testcase_06 AC 52 ms
49,948 KB
testcase_07 AC 49 ms
49,828 KB
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 AC 52 ms
49,872 KB
testcase_19 AC 48 ms
51,704 KB
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 AC 55 ms
50,196 KB
testcase_24 AC 53 ms
50,208 KB
testcase_25 AC 52 ms
50,036 KB
testcase_26 AC 51 ms
49,976 KB
testcase_27 AC 52 ms
49,900 KB
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no184a;

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 final long MOD = 2;
	static IO io = new IO();
	public static void main(String[] args) {
		int n = io.nextInt();
		long[][] m = new long[n][61];
		for(int i=0;i<n;i++) {
			long a = io.nextLong();
			for(int j=0;j<61;j++) {
				m[i][j] = (a >> j) & 1;
			}
		}
		System.out.println(1L << new MatrixMod(m).rank());
	}

}
class MatrixMod {
	public static long MOD = Main.MOD;
	long[][] e;
	int n,m;
	public MatrixMod(long[][] e) {
		this.e = e;
		this.n = e.length;
		this.m = e[0].length;
	}
	public int rank() {
		long[][] x = new long[n][];
		for(int i=0;i<n;i++) {
			x[i] = Arrays.copyOf(e[i], m);
		}
		int rank = 0;
		for(int j=0;j<m;j++) {
			int ind = -1;
			for(int i=rank;i<n;i++) {
				if (x[i][j] != 0) {
					ind = i;
					break;
				}
			}
			if (ind == -1) {
				continue;
			}
			long[] temp = x[ind];
			x[ind] = x[rank];
			x[rank] = temp;
			long a = inverse(x[rank][j], MOD);
			for(int k=j;k<n;k++) {
				x[rank][k] = x[rank][k] * a % MOD;
			}
			for(int i=rank+1;i<n;i++) {
				long b = (MOD - x[i][j]) % MOD;
				for(int k=j;k<n;k++) {
					x[i][k] = (x[rank][k] * b + x[i][k]) % MOD;
				}
			}
			rank++;
		}
		return rank;
	}
	public static long inverse(long a,long mod) {
		long b = mod, u = 1, v = 0;
		while(b > 0) {
			long temp;
			long t = a / b;
			a -= t * b;
			temp = a; a = b; b = temp;
			u -= t * v;
			temp = u; u = v; v = temp;
		}
		return (u % mod + mod) % mod;
	}
	public String toString() {
		return Arrays.deepToString(e);
	}
}
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