結果

問題 No.456 Millions of Submits!
ユーザー uwiuwi
提出日時 2016-12-08 19:11:28
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,463 bytes
コンパイル時間 4,344 ms
コンパイル使用メモリ 82,704 KB
実行使用メモリ 97,672 KB
最終ジャッジ日時 2024-06-23 16:11:39
合計ジャッジ時間 7,682 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
36,924 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2016;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N456_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	double W(double x)
	{
		double v = 0;
		while(true){
			double ev = Math.exp(v);
			double nv = v-(v*ev-x)/(ev*(v+1)-(v+2)*(v*ev-x)/(2*v+2));
			if(Math.abs(v-nv) < 1e-12)return nv;
			v = nv;
		}
	}
	
	void solve()
	{
		StringBuilder sb = new StringBuilder();
		for(int T = ni();T > 0;T--){
			int a = ni(), b = ni();
			double t = nd();
			if(b == 0){
				// x^a=t
				double ans = Math.pow(t, 1./a);
				sb.append(dtos(ans, 11)).append("\n");
			}else if(a == 0){
				// (log x)^b=t
				double ans = Math.exp(Math.pow(t, 1./b));
				sb.append(dtos(ans, 11)).append("\n");
			}else{
				// x = (t^(1/b)/W(t^(1/b)))^(2b/a))
				double tt = Math.pow(t, 1./b)*a/b;
				double ans = Math.pow(tt/W(tt), b/a);
				sb.append(dtos(ans, 11)).append("\n");
			}
		}
		out.print(sb);
	}
	
	public static String dtos(double x, int n) {
		StringBuilder sb = new StringBuilder();
		if(x < 0){
			sb.append('-');
			x = -x;
		}
		x += Math.pow(10, -n)/2;
//		if(x < 0){ x = 0; }
		sb.append((long)x);
		sb.append(".");
		x -= (long)x;
		for(int i = 0;i < n;i++){
			x *= 10;
			sb.append((int)x);
			x -= (int)x;
		}
		return sb.toString();
	}

	
	void run() throws Exception
	{
//		int n = 1000000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(10)+1 + " ");
//			sb.append(gen.nextInt(10)+1 + " ");
//			sb.append(gen.nextDouble()*10+0.1 + " ");
//		}
//		INPUT = sb.toString();

		
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N456_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0