結果
問題 | No.1365 [Cherry 1st Tune] Whose Fault? |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-01-22 22:36:11 |
言語 | D (dmd 2.107.1) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,909 bytes |
コンパイル時間 | 4,589 ms |
コンパイル使用メモリ | 159,596 KB |
実行使用メモリ | 25,712 KB |
最終ジャッジ日時 | 2023-09-04 12:00:01 |
合計ジャッジ時間 | 28,919 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 28 ms
6,340 KB |
testcase_14 | AC | 20 ms
6,080 KB |
testcase_15 | AC | 6 ms
4,384 KB |
testcase_16 | AC | 6 ms
5,348 KB |
testcase_17 | AC | 17 ms
4,856 KB |
testcase_18 | AC | 11 ms
5,096 KB |
testcase_19 | AC | 27 ms
6,408 KB |
testcase_20 | AC | 29 ms
4,724 KB |
testcase_21 | AC | 25 ms
4,840 KB |
testcase_22 | AC | 21 ms
6,408 KB |
testcase_23 | AC | 62 ms
11,924 KB |
testcase_24 | AC | 127 ms
13,528 KB |
testcase_25 | AC | 238 ms
14,292 KB |
testcase_26 | AC | 167 ms
12,436 KB |
testcase_27 | AC | 203 ms
16,148 KB |
testcase_28 | AC | 107 ms
14,432 KB |
testcase_29 | AC | 73 ms
10,880 KB |
testcase_30 | AC | 293 ms
14,128 KB |
testcase_31 | AC | 269 ms
25,712 KB |
testcase_32 | AC | 158 ms
22,036 KB |
testcase_33 | AC | 234 ms
12,116 KB |
testcase_34 | AC | 191 ms
13,248 KB |
testcase_35 | AC | 115 ms
13,696 KB |
testcase_36 | AC | 226 ms
24,592 KB |
testcase_37 | AC | 52 ms
7,744 KB |
testcase_38 | AC | 70 ms
14,584 KB |
testcase_39 | AC | 276 ms
14,332 KB |
testcase_40 | AC | 274 ms
15,136 KB |
testcase_41 | AC | 217 ms
14,924 KB |
testcase_42 | AC | 222 ms
15,492 KB |
testcase_43 | AC | 1 ms
4,388 KB |
testcase_44 | AC | 1,174 ms
25,048 KB |
testcase_45 | TLE | - |
ソースコード
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)); } int root(int[] uf, int u) { return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u])); } bool connect(int[] uf, int u, int v) { u = uf.root(u); v = uf.root(v); if (u == v) return false; if (uf[u] > uf[v]) swap(u, v); uf[u] += uf[v]; uf[v] = u; return true; } /* minimize \sum_i P[i] x[i]^2 subject to \sum_i x[i] = S if P[i] != 0: T := \sum_i 1/P[i] l = S / T x[i] = l / P[i] min = l^2 \sum_i 1/P[i] = l^2 T = S^2 / T */ void main() { try { for (; ; ) { const N = readInt(); auto A = new real[N]; foreach (u; 0 .. N) { A[u] = readReal(); } auto B = new real[N]; foreach (u; 0 .. N) { B[u] = readReal(); } auto P = new real[N]; foreach (u; 0 .. N) { P[u] = readReal(); } const Q = readInt(); auto X = new int[Q]; auto Y = new int[Q]; foreach (q; 0 .. Q) { X[q] = readInt() - 1; Y[q] = readInt() - 1; } auto ss = new real[N]; auto ts = new real[N]; auto zs = new real[N]; foreach (u; 0 .. N) { ss[u] = A[u] - B[u]; ts[u] = 1.0L / P[u]; zs[u] = ss[u] * ss[u] / ts[u]; } real ans = zs.sum; auto uf = new int[N]; uf[] = -1; foreach (q; 0 .. Q) { const ru = uf.root(X[q]); const rv = uf.root(Y[q]); if (ru != rv) { ans -= zs[ru]; ans -= zs[rv]; uf.connect(ru, rv); const r = uf.root(ru); ss[r] = ss[ru] + ss[rv]; ts[r] = ts[ru] + ts[rv]; zs[r] = ss[r] * ss[r] / ts[r]; ans += zs[r]; } writefln("%.10f", ans); } } } catch (EOFException e) { } }