結果

問題 No.130 XOR Minimax
ユーザー ぴろずぴろず
提出日時 2015-01-16 23:45:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 504 ms / 5,000 ms
コード長 4,506 bytes
コンパイル時間 2,540 ms
コンパイル使用メモリ 80,024 KB
実行使用メモリ 73,520 KB
最終ジャッジ日時 2024-09-12 22:33:15
合計ジャッジ時間 10,913 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 302 ms
62,936 KB
testcase_01 AC 53 ms
50,332 KB
testcase_02 AC 53 ms
49,912 KB
testcase_03 AC 54 ms
50,372 KB
testcase_04 AC 198 ms
59,852 KB
testcase_05 AC 468 ms
73,520 KB
testcase_06 AC 458 ms
67,440 KB
testcase_07 AC 504 ms
69,728 KB
testcase_08 AC 402 ms
68,228 KB
testcase_09 AC 146 ms
58,132 KB
testcase_10 AC 185 ms
58,456 KB
testcase_11 AC 431 ms
65,588 KB
testcase_12 AC 124 ms
56,256 KB
testcase_13 AC 349 ms
67,792 KB
testcase_14 AC 393 ms
67,400 KB
testcase_15 AC 74 ms
53,508 KB
testcase_16 AC 370 ms
65,164 KB
testcase_17 AC 362 ms
63,188 KB
testcase_18 AC 350 ms
64,752 KB
testcase_19 AC 408 ms
67,192 KB
testcase_20 AC 293 ms
62,856 KB
testcase_21 AC 392 ms
67,264 KB
testcase_22 AC 184 ms
57,536 KB
testcase_23 AC 115 ms
55,668 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no130;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
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();
		ArrayList<Integer> al = new ArrayList<>(n);
		for(int i=0;i<n;i++) {
			al.add(io.nextInt());
		}
		io.println(dfs(al,30));
		io.flush();
		io.close();
	}

	private static int dfs(ArrayList<Integer> al, int i) {
		if (i == -1) {
			return 0;
		}
		ArrayList<Integer> g0 = new ArrayList<>();
		ArrayList<Integer> g1 = new ArrayList<>();
		for(int n:al) {
			if (((n>>i)&1) == 0) {
				g0.add(n&~(1<<i));
			}else{
				g1.add(n&~(1<<i));
			}
		}
		if (g0.size() == 0) {
			return dfs(g1,i-1);
		}else if(g1.size() == 0) {
			return dfs(g0,i-1);
		}else{
			return (1<<i) + Math.min(dfs(g0,i-1), dfs(g1,i-1));
		}
	}

}

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';}
	private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
	public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	public boolean hasNextLine() { skipNewLine(); 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) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		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[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void arrayInt(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[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
	public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; 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