結果

問題 No.456 Millions of Submits!
ユーザー GrenacheGrenache
提出日時 2016-12-08 11:47:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 4,168 ms / 4,500 ms
コード長 4,853 bytes
コンパイル時間 3,480 ms
コンパイル使用メモリ 78,184 KB
実行使用メモリ 56,868 KB
最終ジャッジ日時 2024-06-23 09:08:52
合計ジャッジ時間 12,825 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,952 KB
testcase_01 AC 47 ms
37,000 KB
testcase_02 AC 46 ms
36,876 KB
testcase_03 AC 48 ms
37,300 KB
testcase_04 AC 49 ms
36,840 KB
testcase_05 AC 56 ms
36,724 KB
testcase_06 AC 55 ms
37,164 KB
testcase_07 AC 109 ms
39,000 KB
testcase_08 AC 109 ms
38,872 KB
testcase_09 AC 225 ms
46,304 KB
testcase_10 AC 213 ms
46,056 KB
testcase_11 AC 834 ms
56,640 KB
testcase_12 AC 4,168 ms
56,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder456_1 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int m = sc.nextInt();

		for (int i = 0; i < m; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			double t = sc.nextDouble();

			double l = 0;
			double r = 30000;
			double EPS = 1.e-10;
			for (int j = 0; j < 45; j++) {
				if (r - l < EPS) {
					break;
				}
				double mid = (l + r) / 2;

				double f = Math.pow(mid, a) * Math.pow(Math.log(mid), b);
//				pr.printf("%e %e\n", mid, f);
				if (f >= t) {
					r = mid;
				} else {
					l = mid;
				}
			}
//			pr.printf("%d %d %e\n", a, b, t);
			pr.println(r);

		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
//			return Double.parseDouble(next());
			double ret = 0;
			try {
				boolean flag = false;
				double base = 0.1;
				int ch = nextPrintable();
				do {
					if (ch == '.') {
						flag = true;
					} else {
						if (!flag) {
							ret *= 10;
							ret += ch - '0';
						} else {
							ret += (ch - '0') * base;
							base /= 10;
						}
					}
				} while (isPrintable(ch = br.read()));

				return ret;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0