結果

問題 No.862 XORでX
ユーザー uwiuwi
提出日時 2019-08-09 23:16:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 151 ms / 2,000 ms
コード長 4,192 bytes
コンパイル時間 3,478 ms
コンパイル使用メモリ 81,392 KB
実行使用メモリ 56,144 KB
最終ジャッジ日時 2023-09-26 22:00:00
合計ジャッジ時間 8,874 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,648 KB
testcase_01 AC 41 ms
49,312 KB
testcase_02 AC 41 ms
49,272 KB
testcase_03 AC 40 ms
49,072 KB
testcase_04 AC 42 ms
49,224 KB
testcase_05 AC 41 ms
49,420 KB
testcase_06 AC 41 ms
49,432 KB
testcase_07 AC 41 ms
49,416 KB
testcase_08 AC 89 ms
52,064 KB
testcase_09 AC 93 ms
52,144 KB
testcase_10 AC 94 ms
51,928 KB
testcase_11 AC 79 ms
52,208 KB
testcase_12 AC 41 ms
49,228 KB
testcase_13 AC 41 ms
49,256 KB
testcase_14 AC 42 ms
49,268 KB
testcase_15 AC 40 ms
49,412 KB
testcase_16 AC 133 ms
54,628 KB
testcase_17 AC 128 ms
54,784 KB
testcase_18 AC 131 ms
54,768 KB
testcase_19 AC 119 ms
54,732 KB
testcase_20 AC 140 ms
54,756 KB
testcase_21 AC 140 ms
54,732 KB
testcase_22 AC 151 ms
55,792 KB
testcase_23 AC 147 ms
54,968 KB
testcase_24 AC 147 ms
54,784 KB
testcase_25 AC 139 ms
55,244 KB
testcase_26 AC 137 ms
55,112 KB
testcase_27 AC 145 ms
54,428 KB
testcase_28 AC 146 ms
55,024 KB
testcase_29 AC 140 ms
55,484 KB
testcase_30 AC 146 ms
55,644 KB
testcase_31 AC 151 ms
56,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190809;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), X = ni();
		if(X >= 2){
			if(n % 2 == 0){
				if(n >= X){
					if(n/2%2 == 1){
						X ^= 1;
					}
					for(int i = 1;i <= n+1;i++){
						if(X/2*2 <= i && i < X/2*2+2){
						}else{
							out.println(i);
						}
					}
					out.println(X);
				}else{
					int u = 0;
					for(int i = 1;i <= n-1;i++){
						u ^= i;
						out.println(i);
					}
					out.println(X^u);
				}
			}else{
				if(n+2 >= X){
					if(n/2%2 == 1){
						X ^= 1;
					}
					for(int i = 2;i <= n+2;i++){
						if(X/2*2 <= i && i < X/2*2+2){
						}else{
							out.println(i);
						}
					}
					out.println(X);
				}else{
					int u = 0;
					for(int i = 2;i <= n;i++){
						u ^= i;
						out.println(i);
					}
					out.println(X^u);
				}
			}
		}else{
			if(n % 4 == 1){
				for(int i = 1;i <= n;i++){
					out.println(i);
				}
			}else if(n % 4 == 2){
				for(int i = 4;i <= n+3;i++){
					out.println(i);
				}
			}else if(n % 4 == 0){
				for(int i = 7;i <= n+3;i++){
					out.println(i);
				}
				out.println(1);
				out.println(3);
				out.println(4);
			}else{
				for(int i = 7;i <= n+4;i++){
					out.println(i);
				}
				out.println(3);
				out.println(5);
			}
		}
	}
	
	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