結果

問題 No.1286 Stone Skipping
ユーザー watarimaycry2watarimaycry2
提出日時 2020-11-13 22:01:50
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,351 bytes
コンパイル時間 3,020 ms
コンパイル使用メモリ 76,788 KB
実行使用メモリ 49,980 KB
最終ジャッジ日時 2023-09-30 02:53:41
合計ジャッジ時間 5,161 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,376 KB
testcase_01 WA -
testcase_02 AC 45 ms
49,452 KB
testcase_03 AC 45 ms
49,412 KB
testcase_04 AC 43 ms
49,328 KB
testcase_05 WA -
testcase_06 AC 44 ms
47,392 KB
testcase_07 AC 44 ms
49,504 KB
testcase_08 AC 45 ms
49,244 KB
testcase_09 AC 44 ms
49,280 KB
testcase_10 AC 45 ms
49,344 KB
testcase_11 AC 44 ms
49,956 KB
testcase_12 AC 45 ms
49,364 KB
testcase_13 AC 44 ms
49,424 KB
testcase_14 AC 45 ms
49,252 KB
testcase_15 WA -
testcase_16 AC 44 ms
49,328 KB
testcase_17 AC 45 ms
49,572 KB
testcase_18 WA -
testcase_19 AC 44 ms
49,264 KB
testcase_20 AC 46 ms
49,412 KB
testcase_21 AC 44 ms
49,848 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 46 ms
49,348 KB
testcase_26 AC 45 ms
49,252 KB
testcase_27 AC 45 ms
49,536 KB
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		long D = nextLong();
		long L = 1;
		long R = 1l << 62;
		while(Math.abs(L - R) > 1){
			int count = 1;
			long init = (L + R) / 2;
			if(D < init){
				R = init;
				continue;
			}
			long now = (L + R) / 2;
			boolean isOK = true;
			while(now < D){
				long sum = init / (long)Math.pow(2, count);
				if(sum == 0){
					isOK = false;
					break;
				}
				now += sum;
				count++;
			}
			if(now == D){
				R = init;
			}else{
				if(now > D){
					R = init;
				}else{
					L = init;
				}
			}
		}
		
		myout(R);
	}
	//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.add(read);
				}
			}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> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		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