結果

問題 No.5001 排他的論理和でランニング
ユーザー 37zigen
提出日時 2018-03-25 17:50:11
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,179 ms / 1,500 ms
コード長 3,245 bytes
コンパイル時間 2,410 ms
実行使用メモリ 54,344 KB
スコア 52,428,731
最終ジャッジ日時 2020-03-12 20:55:04
ジャッジサーバーID
（参考情報） 		judge6 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner();
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
		}
		int[] member = new int[m];
		int answer = 0;
		boolean[] isMember = new boolean[n];
		for (int i = 0; i < m; ++i) {
			answer ^= a[i];
			member[i] = i;
			isMember[i] = true;

		}
		for (int i = 0; i < 1e7; ++i) {
			int rnd1 = (int) (Math.random() * m);
			int rnd2 = (int) (Math.random() * n);
			if (isMember[rnd2])
				continue;
			int tmp = answer ^ a[rnd2] ^ a[member[rnd1]];
			if (tmp > answer) {
				isMember[member[rnd1]] = false;
				isMember[rnd2] = true;
				member[rnd1] = rnd2;
				answer = tmp;
			}
		}
		for (int i = 0; i < m; ++i) {
			System.out.print(a[member[i]] + (i == m - 1 ? "\n" : " "));
		}
	}
	class Scanner {
	    private final InputStream in = System.in;
	    private final byte[] buffer = new byte[1024];
	    private int ptr = 0;
	    private int buflen = 0;
	    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 boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next());}
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}
0