結果
問題 | No.456 Millions of Submits! |
ユーザー | 37zigen |
提出日時 | 2016-12-09 01:13:29 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,047 bytes |
コンパイル時間 | 4,643 ms |
コンパイル使用メモリ | 88,156 KB |
実行使用メモリ | 88,124 KB |
最終ジャッジ日時 | 2024-06-23 16:44:41 |
合計ジャッジ時間 | 13,527 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 116 ms
61,220 KB |
testcase_01 | AC | 122 ms
54,168 KB |
testcase_02 | AC | 120 ms
54,076 KB |
testcase_03 | AC | 121 ms
54,088 KB |
testcase_04 | AC | 118 ms
53,856 KB |
testcase_05 | AC | 142 ms
54,364 KB |
testcase_06 | AC | 149 ms
54,224 KB |
testcase_07 | AC | 237 ms
58,164 KB |
testcase_08 | AC | 237 ms
58,016 KB |
testcase_09 | AC | 459 ms
62,344 KB |
testcase_10 | AC | 451 ms
61,748 KB |
testcase_11 | WA | - |
testcase_12 | TLE | - |
ソースコード
package yukicoder; import java.util.*; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; class Q456 { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solver() { int m = ni(); while (m-- > 0) { double a = nd(); double b = nd(); double t = nd(); double ans; if (a == 0) { t = Math.pow(t, 1 / b); ans = Math.exp(t); } else if (b == 0) { t = Math.pow(t, 1 / a); ans = t; } else { double curN = 5.5; for (int i = 0; i < 27; ++i) { double y = -t + pow(curN, (int) a) * pow(Math.log1p(curN - 1), (int) b); double yDiff = a * pow(curN, (int) a - 1) * pow(Math.log1p(curN - 1), (int) b) + b * pow(curN, (int) a - 1) * pow(Math.log1p(curN - 1), (int) b - 1); curN = curN - y / yDiff; } ans = curN; } out.printf("%.12f\n", ans); } } static double pow(double a, int n) { double ret = 1; for (; n > 0; n >>= 1, a *= a) { if (n % 2 == 1) { ret *= a; } } return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solver(); 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 Q456().run(); } private static byte[] inbuf = new byte[1024]; public static int lenbuf = 0; public static int ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private static int skip() { int b; while ((b = readByte()) != -1 && isSpaceChar(b)) ; return b; } private static double nd() { return Double.parseDouble(ns()); } private char nc() { return (char) skip(); } private static 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 static int ni() { return (int) nl(); } private static 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)); } }