結果
問題 | No.5001 排他的論理和でランニング |
ユーザー | 37zigen |
提出日時 | 2018-03-25 17:56:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,050 ms / 1,500 ms |
コード長 | 2,978 bytes |
コンパイル時間 | 2,299 ms |
実行使用メモリ | 51,032 KB |
スコア | 52,428,741 |
最終ジャッジ日時 | 2020-03-12 20:55:59 |
ジャッジサーバーID (参考情報) |
judge6 / |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,046 ms
50,120 KB |
testcase_01 | AC | 929 ms
44,852 KB |
testcase_02 | AC | 971 ms
45,072 KB |
testcase_03 | AC | 995 ms
46,948 KB |
testcase_04 | AC | 1,050 ms
50,304 KB |
testcase_05 | AC | 972 ms
47,312 KB |
testcase_06 | AC | 946 ms
46,956 KB |
testcase_07 | AC | 968 ms
47,100 KB |
testcase_08 | AC | 936 ms
50,132 KB |
testcase_09 | AC | 909 ms
46,912 KB |
testcase_10 | AC | 920 ms
49,292 KB |
testcase_11 | AC | 941 ms
47,000 KB |
testcase_12 | AC | 933 ms
49,232 KB |
testcase_13 | AC | 968 ms
50,552 KB |
testcase_14 | AC | 981 ms
46,944 KB |
testcase_15 | AC | 981 ms
48,996 KB |
testcase_16 | AC | 982 ms
45,296 KB |
testcase_17 | AC | 934 ms
46,888 KB |
testcase_18 | AC | 969 ms
46,856 KB |
testcase_19 | AC | 967 ms
47,120 KB |
testcase_20 | AC | 995 ms
47,236 KB |
testcase_21 | AC | 949 ms
46,844 KB |
testcase_22 | AC | 926 ms
45,048 KB |
testcase_23 | AC | 934 ms
44,856 KB |
testcase_24 | AC | 920 ms
45,024 KB |
testcase_25 | AC | 955 ms
49,068 KB |
testcase_26 | AC | 962 ms
49,060 KB |
testcase_27 | AC | 923 ms
45,016 KB |
testcase_28 | AC | 1,028 ms
51,032 KB |
testcase_29 | AC | 1,000 ms
46,940 KB |
testcase_30 | AC | 965 ms
45,308 KB |
testcase_31 | AC | 1,024 ms
47,252 KB |
testcase_32 | AC | 993 ms
46,980 KB |
testcase_33 | AC | 998 ms
50,128 KB |
testcase_34 | AC | 1,012 ms
50,184 KB |
testcase_35 | AC | 1,022 ms
46,896 KB |
testcase_36 | AC | 1,034 ms
50,220 KB |
testcase_37 | AC | 983 ms
47,248 KB |
testcase_38 | AC | 979 ms
49,000 KB |
testcase_39 | AC | 937 ms
49,368 KB |
testcase_40 | AC | 986 ms
47,016 KB |
testcase_41 | AC | 956 ms
44,820 KB |
testcase_42 | AC | 976 ms
47,148 KB |
testcase_43 | AC | 1,002 ms
47,064 KB |
testcase_44 | AC | 1,013 ms
47,312 KB |
testcase_45 | AC | 1,029 ms
49,324 KB |
testcase_46 | AC | 950 ms
46,936 KB |
testcase_47 | AC | 990 ms
50,852 KB |
testcase_48 | AC | 978 ms
47,056 KB |
testcase_49 | AC | 963 ms
50,072 KB |
ソースコード
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[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; } } PrintWriter pw = new PrintWriter(System.out); for (int i = 0; i < m; ++i) { pw.print(a[member[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)); } }