結果

問題 No.130 XOR Minimax
ユーザー yuya178yuya178
提出日時 2017-09-30 01:37:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 346 ms / 5,000 ms
コード長 4,988 bytes
コンパイル時間 3,101 ms
コンパイル使用メモリ 77,524 KB
実行使用メモリ 63,848 KB
最終ジャッジ日時 2023-10-10 00:22:34
合計ジャッジ時間 10,633 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 299 ms
59,576 KB
testcase_01 AC 71 ms
50,888 KB
testcase_02 AC 71 ms
50,508 KB
testcase_03 AC 74 ms
51,060 KB
testcase_04 AC 190 ms
60,140 KB
testcase_05 AC 247 ms
63,848 KB
testcase_06 AC 309 ms
62,540 KB
testcase_07 AC 342 ms
62,768 KB
testcase_08 AC 318 ms
60,312 KB
testcase_09 AC 184 ms
57,920 KB
testcase_10 AC 214 ms
57,632 KB
testcase_11 AC 346 ms
62,676 KB
testcase_12 AC 136 ms
56,444 KB
testcase_13 AC 299 ms
60,124 KB
testcase_14 AC 341 ms
60,040 KB
testcase_15 AC 121 ms
56,604 KB
testcase_16 AC 338 ms
61,548 KB
testcase_17 AC 304 ms
60,432 KB
testcase_18 AC 319 ms
60,008 KB
testcase_19 AC 332 ms
60,056 KB
testcase_20 AC 299 ms
60,356 KB
testcase_21 AC 335 ms
60,400 KB
testcase_22 AC 213 ms
59,488 KB
testcase_23 AC 145 ms
58,316 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int n = ni();
        ArrayList<Integer> a = new ArrayList<>();
        for(int i = 0; i < n; i++){
            a.add(ni());
        }
        System.out.println(f(a,30));

    }

    private static int f(ArrayList<Integer> a , int pos){
        if(pos < 0) return 0;
        ArrayList<Integer> zero = new ArrayList<>();
        ArrayList<Integer> one = new ArrayList<>();
        for(int i = 0; i < a.size(); i ++){
            if(((a.get(i)>>pos)&1) == 0){
                zero.add(a.get(i));
            }
            else one.add(a.get(i));
        }
        if(one.size() == 0){
            return f(zero, pos-1);
        }
        else if(zero.size() == 0) {
            return f(one, pos - 1);
        }
        else{
            return (1<<pos) + Math.min(f(one,pos-1), f(zero, pos-1));
        }
    }

    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }


    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0