結果

問題 No.5001 排他的論理和でランニング
ユーザー 37zigen37zigen
提出日時 2018-03-25 18:11:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,130 ms / 1,500 ms
コード長 3,103 bytes
コンパイル時間 2,235 ms
実行使用メモリ 54,288 KB
スコア 52,428,750
最終ジャッジ日時 2020-03-12 20:57:06
ジャッジサーバーID
（参考情報） 		judge7 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,079 ms
50,512 KB
testcase_01 AC 980 ms
47,368 KB
testcase_02 AC 999 ms
47,912 KB
testcase_03 AC 1,060 ms
50,804 KB
testcase_04 AC 1,116 ms
54,288 KB
testcase_05 AC 1,020 ms
51,864 KB
testcase_06 AC 1,061 ms
50,280 KB
testcase_07 AC 1,053 ms
52,320 KB
testcase_08 AC 1,087 ms
50,356 KB
testcase_09 AC 942 ms
48,824 KB
testcase_10 AC 1,011 ms
51,752 KB
testcase_11 AC 1,033 ms
50,800 KB
testcase_12 AC 1,012 ms
48,124 KB
testcase_13 AC 1,089 ms
50,700 KB
testcase_14 AC 1,068 ms
50,436 KB
testcase_15 AC 1,027 ms
49,852 KB
testcase_16 AC 984 ms
47,164 KB
testcase_17 AC 999 ms
48,128 KB
testcase_18 AC 1,062 ms
52,360 KB
testcase_19 AC 1,016 ms
50,224 KB
testcase_20 AC 998 ms
47,128 KB
testcase_21 AC 1,012 ms
47,800 KB
testcase_22 AC 959 ms
46,924 KB
testcase_23 AC 967 ms
45,036 KB
testcase_24 AC 998 ms
47,756 KB
testcase_25 AC 1,046 ms
50,132 KB
testcase_26 AC 1,079 ms
50,052 KB
testcase_27 AC 1,007 ms
48,056 KB
testcase_28 AC 1,071 ms
50,280 KB
testcase_29 AC 1,060 ms
50,296 KB
testcase_30 AC 977 ms
47,296 KB
testcase_31 AC 1,081 ms
50,388 KB
testcase_32 AC 1,017 ms
47,964 KB
testcase_33 AC 1,112 ms
52,276 KB
testcase_34 AC 1,130 ms
52,660 KB
testcase_35 AC 1,062 ms
50,368 KB
testcase_36 AC 1,041 ms
52,368 KB
testcase_37 AC 1,075 ms
52,420 KB
testcase_38 AC 996 ms
50,072 KB
testcase_39 AC 1,018 ms
47,824 KB
testcase_40 AC 1,035 ms
50,048 KB
testcase_41 AC 975 ms
47,088 KB
testcase_42 AC 1,020 ms
48,160 KB
testcase_43 AC 1,046 ms
50,500 KB
testcase_44 AC 1,080 ms
50,736 KB
testcase_45 AC 1,094 ms
50,268 KB
testcase_46 AC 1,043 ms
50,704 KB
testcase_47 AC 1,023 ms
48,248 KB
testcase_48 AC 1,010 ms
48,252 KB
testcase_49 AC 1,079 ms
50,296 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
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[n + m];
		for (int i = 0; i < member.length; ++i)
			member[i] = i;
		int answer = 0;
		for (int i = 0; i < m; ++i) {
			answer ^= a[i];
		}
		int cur = answer;
		int[] ans_arr = new int[n + m];
		ans_arr = Arrays.copyOf(member, member.length);
		for (int i = 0; i < 1e7; ++i) {
			int rnd1 = (int) (Math.random() * (n - m)) + m;
			int rnd2 = (int) (Math.random() * m);
			cur = cur ^ a[member[rnd1]] ^ a[member[rnd2]];
			member[rnd2] ^= member[rnd1];
			member[rnd1] ^= member[rnd2];
			member[rnd2] ^= member[rnd1];
			if (cur > answer) {
				answer = cur;
				ans_arr = Arrays.copyOf(member, member.length);
			}
		}
		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 0; i < m; ++i) {
			pw.print(a[ans_arr[i]] + (i == m - 1 ? "\n" : " "));
		}
		pw.close();
	}

	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