結果

問題 No.456 Millions of Submits!
ユーザー t8m8⛄️t8m8⛄️
提出日時 2016-12-08 17:32:06
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 3,520 bytes
コンパイル時間 3,554 ms
コンパイル使用メモリ 93,448 KB
実行使用メモリ 72,748 KB
最終ジャッジ日時 2024-06-23 16:08:16
合計ジャッジ時間 15,798 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 124 ms
47,072 KB
testcase_01 AC 124 ms
41,212 KB
testcase_02 AC 133 ms
41,468 KB
testcase_03 AC 118 ms
40,304 KB
testcase_04 AC 139 ms
41,836 KB
testcase_05 AC 151 ms
41,724 KB
testcase_06 AC 147 ms
41,824 KB
testcase_07 AC 231 ms
44,408 KB
testcase_08 AC 249 ms
44,616 KB
testcase_09 AC 463 ms
55,448 KB
testcase_10 AC 465 ms
55,408 KB
testcase_11 AC 1,736 ms
72,748 KB
testcase_12 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;

public class No0456 {

	static final Reader in = new Reader();
	static final PrintWriter out = new PrintWriter(System.out,false);
	static boolean debug = false;

	static void solve(){
		int m = in.nextInt();
		for (int k=0; k<m; k++) {
			int a = in.nextInt();
			int b = in.nextInt();
			double t = in.nextDouble();
			double l = 0.0;
			double r = 1000000000.0;
			for (int i=0; i<64; i++) {
				double mid = (l + r) / 2;
				if (Math.pow(mid, a)*Math.pow(Math.log(mid), b) <= t) l = mid;
				else r = mid;
			}

			out.printf("%.11f\n",r);
		}
	}

	public static void main(String[] args) throws Exception {
		debug = args.length > 0;
		long start = System.nanoTime();

		solve();
		out.flush();

		long end = System.nanoTime();
		dump((end - start) / 1000000 + " ms");
		in.close();
		out.close();
	}

	static void dump(Object... o) { if (debug) System.err.println(Arrays.deepToString(o)); }
}

class Reader {
	private final InputStream in;
	private final byte[] buf = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public Reader() { this(System.in);}
	public Reader(InputStream source) { this.in = source;}

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

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

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

	private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

	public boolean hasNext() {skip(); 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();
		boolean minus = false;
		long num = readByte();

		if(num == '-'){
			num = 0;
			minus = true;
		}else if (num < '0' || '9' < num){
			throw new NumberFormatException();
		}else{
			num -= '0';
		}

		while(true){
			int b = readByte();
			if('0' <= b && b <= '9')
				num = num * 10 + (b - '0');
			else if(b == -1 || !isPrintableChar(b))
				return minus ? -num : num;
			else
				throw new NoSuchElementException();
		}
	}

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

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

	public char nextChar() {
		if (!hasNext()) throw new NoSuchElementException();
		return (char)readByte();
	}

	public String nextLine() {
		while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
		if (!hasNextByte()) throw new NoSuchElementException();

		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (b != '\n' && b != '\r' && b != -1) {
			sb.appendCodePoint(b);
			b = readByte();
		}

		return sb.toString();
	}

	public int[] nextIntArray(int n) {
		int[] res = new int[n];
		for (int i=0; i<n; i++) res[i] = nextInt();
		return res;
	}

	public char[] nextCharArray(int n) {
		char[] res = new char[n];
		for (int i=0; i<n; i++) res[i] = nextChar();
		return res;
	}

	public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0