結果

問題 No.1042 愚直大学
ユーザー k_6101k_6101
提出日時 2020-05-01 22:57:14
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,234 bytes
コンパイル時間 2,536 ms
コンパイル使用メモリ 92,592 KB
実行使用メモリ 48,796 KB
最終ジャッジ日時 2024-06-07 11:18:06
合計ジャッジ時間 4,787 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
48,644 KB
testcase_01 AC 58 ms
48,676 KB
testcase_02 AC 56 ms
48,528 KB
testcase_03 AC 58 ms
48,796 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 58 ms
48,648 KB
testcase_07 AC 57 ms
48,680 KB
testcase_08 AC 57 ms
48,372 KB
testcase_09 AC 58 ms
48,624 KB
testcase_10 AC 57 ms
48,344 KB
testcase_11 AC 57 ms
48,640 KB
testcase_12 AC 57 ms
48,628 KB
testcase_13 AC 57 ms
48,632 KB
testcase_14 AC 57 ms
48,452 KB
testcase_15 AC 58 ms
48,336 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 58 ms
48,588 KB
testcase_19 WA -
testcase_20 AC 58 ms
48,764 KB
testcase_21 AC 57 ms
48,640 KB
testcase_22 AC 57 ms
48,612 KB
testcase_23 AC 58 ms
48,416 KB
testcase_24 AC 56 ms
48,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	public void solve() {
		double P = (double)ni();
		double Q = (double)ni();
		double l = 1;
		double r = 1e10;
		double m = 1, log2 = Math.log(2);
		for (int i = 0; i < 1000000; i++) {
			if(r - l <= 0.000001)	break;
			m = (l + r) / 2;
			if(P + Q * m * Math.log(m) / log2 >= m * m) {
				l = m;
			} else {
				r = m;
			}
		}
//		out.println("l = " + l + "  r = " + r);
		BigDecimal ans = new BigDecimal(m);
		out.println(ans.setScale(6,BigDecimal.ROUND_HALF_UP));
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

	int[] ni(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
0