結果
問題 | No.2009 Drunkers' Contest |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-07-15 22:26:21 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 118 ms / 2,000 ms |
コード長 | 2,214 bytes |
コンパイル時間 | 3,064 ms |
コンパイル使用メモリ | 160,908 KB |
実行使用メモリ | 36,416 KB |
最終ジャッジ日時 | 2023-09-04 17:51:35 |
合計ジャッジ時間 | 11,519 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 3 ms
4,380 KB |
testcase_15 | AC | 3 ms
4,376 KB |
testcase_16 | AC | 3 ms
4,384 KB |
testcase_17 | AC | 3 ms
4,380 KB |
testcase_18 | AC | 4 ms
4,380 KB |
testcase_19 | AC | 4 ms
4,380 KB |
testcase_20 | AC | 4 ms
4,376 KB |
testcase_21 | AC | 4 ms
4,384 KB |
testcase_22 | AC | 4 ms
5,248 KB |
testcase_23 | AC | 4 ms
4,380 KB |
testcase_24 | AC | 114 ms
31,896 KB |
testcase_25 | AC | 115 ms
32,116 KB |
testcase_26 | AC | 114 ms
30,660 KB |
testcase_27 | AC | 113 ms
31,084 KB |
testcase_28 | AC | 115 ms
30,988 KB |
testcase_29 | AC | 115 ms
32,212 KB |
testcase_30 | AC | 114 ms
31,500 KB |
testcase_31 | AC | 113 ms
30,768 KB |
testcase_32 | AC | 114 ms
31,844 KB |
testcase_33 | AC | 113 ms
32,084 KB |
testcase_34 | AC | 102 ms
34,076 KB |
testcase_35 | AC | 102 ms
33,324 KB |
testcase_36 | AC | 102 ms
33,028 KB |
testcase_37 | AC | 101 ms
34,612 KB |
testcase_38 | AC | 102 ms
34,408 KB |
testcase_39 | AC | 103 ms
32,824 KB |
testcase_40 | AC | 102 ms
34,652 KB |
testcase_41 | AC | 102 ms
34,488 KB |
testcase_42 | AC | 102 ms
34,544 KB |
testcase_43 | AC | 102 ms
34,164 KB |
testcase_44 | AC | 116 ms
36,416 KB |
testcase_45 | AC | 118 ms
34,044 KB |
testcase_46 | AC | 86 ms
29,876 KB |
testcase_47 | AC | 70 ms
27,724 KB |
testcase_48 | AC | 70 ms
29,036 KB |
testcase_49 | AC | 70 ms
27,884 KB |
testcase_50 | AC | 70 ms
28,232 KB |
testcase_51 | AC | 70 ms
27,936 KB |
testcase_52 | AC | 71 ms
28,164 KB |
testcase_53 | AC | 86 ms
29,632 KB |
testcase_54 | AC | 83 ms
30,652 KB |
testcase_55 | AC | 82 ms
28,280 KB |
testcase_56 | AC | 82 ms
28,432 KB |
testcase_57 | AC | 81 ms
30,748 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; auto A = new real[N]; foreach (i; 0 .. N) { A[i] = readReal; } auto B = new real[N]; foreach (i; 0 .. N) { B[i] = readReal; } int len; auto as = new real[N]; auto bs = new real[N]; auto xs = new real[N]; foreach (i; 0 .. N) { real a = A[i]; real b = B[i]; real x = max(sqrt(a / b), 1.0L); for (; len >= 1 && xs[len - 1] > x; ) { --len; a += as[len]; b += bs[len]; x = max(sqrt(a / b), 1.0L); } as[len] = a; bs[len] = b; xs[len] = x; ++len; } debug { writeln("as = ", as[0 .. len]); writeln("bs = ", bs[0 .. len]); writeln("xs = ", xs[0 .. len]); } real ans = 0.0L; foreach (j; 0 .. len) { ans += as[j] / xs[j] + bs[j] * xs[j]; } writefln("%.12f", ans); } } catch (EOFException e) { } }