結果

問題 No.1298 OR XOR
ユーザー watarimaycry2watarimaycry2
提出日時 2020-11-27 21:55:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 105 ms / 2,000 ms
コード長 3,618 bytes
コンパイル時間 2,556 ms
コンパイル使用メモリ 82,872 KB
実行使用メモリ 40,704 KB
最終ジャッジ日時 2024-07-26 12:25:06
合計ジャッジ時間 4,555 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
40,256 KB
testcase_01 AC 54 ms
37,076 KB
testcase_02 AC 54 ms
37,292 KB
testcase_03 AC 53 ms
37,440 KB
testcase_04 AC 55 ms
37,456 KB
testcase_05 AC 54 ms
37,112 KB
testcase_06 AC 90 ms
38,840 KB
testcase_07 AC 101 ms
40,180 KB
testcase_08 AC 92 ms
40,276 KB
testcase_09 AC 101 ms
40,704 KB
testcase_10 AC 103 ms
40,440 KB
testcase_11 AC 105 ms
40,440 KB
testcase_12 AC 103 ms
40,384 KB
testcase_13 AC 103 ms
40,436 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		int N = nextInt();
		int bitCount = 0;
		
		int L = 0;
		int R = 0;
		int C = 0;
		ArrayList<Integer> bit = new ArrayList<>();
		while(N > 0){
			bit.add(N % 2);
			bitCount += N % 2;
			N /= 2;
		}
		if(bitCount < 2){
			myout("-1 -1 -1");
			return;
		}
		int lBitCount = 0;
		int rBitCount = 0;
		for(int i = 0; i < bit.size(); i++){
			if(bit.get(i) == 1){
				if(lBitCount == 0){
					C += 1 << i;
				}
				if(lBitCount < bitCount - 1){
					lBitCount++;
					L += 1 << i;
				}
			}
		}
		for(int i = bit.size() - 1; i >= 0; i--){
			if(bit.get(i) == 1){
				if(rBitCount == 0){
					C += 1 << i;
				}
				if(rBitCount < bitCount - 1){
					rBitCount++;
					R += 1 << i;
				}
			}
		}
		myerr(bit);
		myerr(bitCount);
		myout(L + " " + R + " " + C);
		
	}
	//Method addition frame start



	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
}
0