結果
問題 | No.1228 I hate XOR Matching |
ユーザー | uwi |
提出日時 | 2020-09-11 22:41:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 5,402 bytes |
コンパイル時間 | 3,628 ms |
コンパイル使用メモリ | 80,292 KB |
実行使用メモリ | 53,600 KB |
最終ジャッジ日時 | 2023-08-27 15:40:58 |
合計ジャッジ時間 | 9,625 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
50,508 KB |
testcase_01 | AC | 62 ms
50,444 KB |
testcase_02 | AC | 60 ms
50,732 KB |
testcase_03 | AC | 38 ms
49,348 KB |
testcase_04 | AC | 57 ms
50,852 KB |
testcase_05 | AC | 59 ms
50,772 KB |
testcase_06 | AC | 40 ms
49,388 KB |
testcase_07 | AC | 62 ms
50,728 KB |
testcase_08 | AC | 60 ms
50,508 KB |
testcase_09 | AC | 59 ms
50,472 KB |
testcase_10 | AC | 59 ms
50,648 KB |
testcase_11 | AC | 61 ms
50,672 KB |
testcase_12 | AC | 62 ms
50,704 KB |
testcase_13 | AC | 41 ms
47,476 KB |
testcase_14 | AC | 41 ms
47,264 KB |
testcase_15 | AC | 40 ms
49,416 KB |
testcase_16 | AC | 41 ms
47,424 KB |
testcase_17 | AC | 41 ms
49,252 KB |
testcase_18 | AC | 40 ms
49,812 KB |
testcase_19 | AC | 61 ms
50,588 KB |
testcase_20 | AC | 62 ms
50,688 KB |
testcase_21 | AC | 62 ms
50,892 KB |
testcase_22 | AC | 61 ms
50,700 KB |
testcase_23 | AC | 62 ms
50,428 KB |
testcase_24 | AC | 61 ms
50,492 KB |
testcase_25 | AC | 107 ms
53,208 KB |
testcase_26 | AC | 105 ms
53,548 KB |
testcase_27 | AC | 100 ms
51,576 KB |
testcase_28 | AC | 105 ms
53,380 KB |
testcase_29 | AC | 63 ms
50,844 KB |
testcase_30 | AC | 63 ms
50,588 KB |
testcase_31 | AC | 61 ms
50,996 KB |
testcase_32 | AC | 107 ms
53,580 KB |
testcase_33 | AC | 105 ms
53,600 KB |
testcase_34 | AC | 58 ms
50,640 KB |
ソースコード
package contest200911; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; public class F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { //// int[] q = new int[]{1, 1, 2, 2, 3}; // int[] q = new int[]{3}; // int u = q.length; // int ct = 0; // int[] t = new int[16]; // for(int i = 0;i < 1<<u;i++){ // int v = 0; // for(int j = 0;j < u;j++){ // if(i<<~j<0){ // v ^= q[j]; // } // } // t[v]++; // } // tr(t); // if(true)return; int K = ni(), X = ni(); if(X == 0){ out.println("Yes"); out.println(1); out.println(K^1); return; } if(K == 0){ X++; } if((X&X-1) != 0){ out.println("No"); return; } int M = Integer.numberOfTrailingZeros(X); // (1<<bc)*2-bc = log X for(int need = K > 0 ? 1 : 0;;need++){ long got = (1L<<need)*2 - need; if(got >= M){ List<Integer> span = new ArrayList<>(); span.add(K); int h = 1; while(basis(span) < need){ span.add(h); h *= 2; } M += need; int OM = M; List<Integer> ret = new ArrayList<>(); long[] bas = basis2(span); if(M > 0){ ret.add(K); M--; } if(M > 0){ ret.add(K); M--; } for(int i = 0;i < 1<<20 && M > 0;i++){ if(i == K)continue; if(M > 0 && hasSolution(i, bas)){ ret.add(i); M--; } if(M > 0 && hasSolution(i, bas)){ ret.add(i); M--; } } out.println("Yes"); out.println(OM); for(int v : ret){ out.print(v + " "); } out.println(); return; } } } public static long basis(List<Integer> span) { long[] bas = new long[64]; for(long x : span){ int h = 63-Long.numberOfLeadingZeros(x); while(x != 0){ if(bas[h] != 0){ x ^= bas[h]; h = 63-Long.numberOfLeadingZeros(x); }else{ bas[h] = x; } } } long ret = 0; for(int i = 0;i <64;i++){ if(bas[i] != 0){ ret++; } } return ret; } public static boolean hasSolution(long x, long[] bas) { int h = 63-Long.numberOfLeadingZeros(x); while(x != 0){ if(bas[h] != 0){ x ^= bas[h]; h = 63-Long.numberOfLeadingZeros(x); }else{ return false; } } return true; } public static long[] basis2(List<Integer> span) { long[] bas = new long[64]; for(long x : span){ int h = 63-Long.numberOfLeadingZeros(x); while(x != 0){ if(bas[h] != 0){ x ^= bas[h]; h = 63-Long.numberOfLeadingZeros(x); }else{ bas[h] = x; } } } return bas; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new F().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private 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 int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private 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) { System.out.println(Arrays.deepToString(o)); } }