結果

問題 No.1228 I hate XOR Matching
ユーザー uwiuwi
提出日時 2020-09-11 22:09:38
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,336 bytes
コンパイル時間 4,659 ms
コンパイル使用メモリ 85,132 KB
実行使用メモリ 51,048 KB
最終ジャッジ日時 2023-08-27 14:49:35
合計ジャッジ時間 13,720 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
50,824 KB
testcase_01 AC 66 ms
50,680 KB
testcase_02 AC 66 ms
50,716 KB
testcase_03 AC 43 ms
49,828 KB
testcase_04 AC 66 ms
50,792 KB
testcase_05 AC 66 ms
50,548 KB
testcase_06 AC 42 ms
49,428 KB
testcase_07 AC 65 ms
50,736 KB
testcase_08 AC 66 ms
51,048 KB
testcase_09 WA -
testcase_10 AC 68 ms
50,464 KB
testcase_11 AC 67 ms
50,608 KB
testcase_12 AC 66 ms
50,720 KB
testcase_13 AC 43 ms
49,396 KB
testcase_14 AC 43 ms
49,300 KB
testcase_15 AC 43 ms
49,288 KB
testcase_16 AC 43 ms
49,476 KB
testcase_17 AC 42 ms
47,328 KB
testcase_18 AC 42 ms
49,476 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 K = ni(), X = ni();
		if(K > 0){
			if(X == 0){
				out.println("Yes");
				out.println(1);
				out.println(K^1);
				return;
			}
			if((X&X-1) != 0){
				out.println("No");
				return;
			}
			List<Integer> all = new ArrayList<>();
			all.add(K);
			int num = 1;
			if(num < X){all.add(0); num *= 2; }
			if(num < X){all.add(0); num *= 2; }
			if(num < X){all.add(K); num *= 2; }
			int p = 1;
			while(num < X){
				if(p == K)p++;
				all.add(p);
				all.add(p);
				num *= 2;
			}
			if(all.size() <= 40){
				out.println("Yes");
				out.println(all.size());
				for(int v : all){
					out.print(v + " ");
				}
				out.println();
			}else{
				out.println("No");
			}
		}else{
			if(X == 0){
				out.println("Yes");
				out.println(1);
				out.println(114514);
				return;
			}
			X++;
			if((X&X-1) != 0){
				out.println("No");
				return;
			}
			List<Integer> all = new ArrayList<>();
			int num = 1;
			if(num < X){all.add(0); num *= 2; }
			if(num < X){all.add(0); num *= 2; }
			int p = 1;
			while(num < X){
				all.add(p);
				all.add(p);
				num *= 2;
			}
			if(all.size() <= 40){
				out.println("Yes");
				out.println(all.size());
				for(int v : all){
					out.print(v + " ");
				}
				out.println();
			}else{
				out.println("No");
			}
		}
	}
	
	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)); }
}
0