結果
問題 | No.1124 Earthquake Safety |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-07-22 22:01:53 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 1,469 ms / 3,000 ms |
コード長 | 5,976 bytes |
コンパイル時間 | 3,057 ms |
コンパイル使用メモリ | 152,760 KB |
実行使用メモリ | 224,840 KB |
最終ジャッジ日時 | 2023-09-04 08:37:56 |
合計ジャッジ時間 | 59,973 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 5 ms
4,376 KB |
testcase_07 | AC | 35 ms
6,804 KB |
testcase_08 | AC | 418 ms
35,636 KB |
testcase_09 | AC | 1,411 ms
88,772 KB |
testcase_10 | AC | 1,155 ms
224,840 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1,463 ms
91,088 KB |
testcase_15 | AC | 1,442 ms
90,776 KB |
testcase_16 | AC | 1,450 ms
89,728 KB |
testcase_17 | AC | 1,460 ms
89,496 KB |
testcase_18 | AC | 1,452 ms
90,800 KB |
testcase_19 | AC | 1,469 ms
90,608 KB |
testcase_20 | AC | 1,461 ms
89,236 KB |
testcase_21 | AC | 1,469 ms
90,072 KB |
testcase_22 | AC | 1,459 ms
89,756 KB |
testcase_23 | AC | 1,430 ms
90,816 KB |
testcase_24 | AC | 1,422 ms
90,568 KB |
testcase_25 | AC | 1,338 ms
92,136 KB |
testcase_26 | AC | 1,350 ms
90,868 KB |
testcase_27 | AC | 1,309 ms
97,096 KB |
testcase_28 | AC | 1,328 ms
100,756 KB |
testcase_29 | AC | 1,381 ms
122,000 KB |
testcase_30 | AC | 1,372 ms
122,824 KB |
testcase_31 | AC | 1,377 ms
150,220 KB |
testcase_32 | AC | 1,416 ms
158,740 KB |
testcase_33 | AC | 1,451 ms
162,140 KB |
testcase_34 | AC | 1,466 ms
173,064 KB |
testcase_35 | AC | 1,227 ms
88,876 KB |
testcase_36 | AC | 1,213 ms
91,632 KB |
testcase_37 | AC | 1,205 ms
90,808 KB |
testcase_38 | AC | 1,199 ms
89,780 KB |
testcase_39 | AC | 1,185 ms
90,772 KB |
testcase_40 | AC | 1,181 ms
91,184 KB |
testcase_41 | AC | 1,186 ms
92,204 KB |
testcase_42 | AC | 1,164 ms
90,960 KB |
testcase_43 | AC | 1,153 ms
90,384 KB |
testcase_44 | AC | 1,180 ms
72,052 KB |
testcase_45 | AC | 1,167 ms
75,464 KB |
testcase_46 | AC | 1,144 ms
76,300 KB |
testcase_47 | AC | 1,143 ms
74,164 KB |
testcase_48 | AC | 1,134 ms
83,596 KB |
testcase_49 | AC | 1,150 ms
86,220 KB |
testcase_50 | AC | 2 ms
4,376 KB |
testcase_51 | AC | 1 ms
4,376 KB |
testcase_52 | AC | 1 ms
4,376 KB |
testcase_53 | AC | 2 ms
4,380 KB |
testcase_54 | AC | 1 ms
4,380 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | AC | 2 ms
4,380 KB |
testcase_57 | AC | 2 ms
4,376 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)); } struct ModInt(int M_) { import std.conv : to; alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { if (a < 0) return (this = inv()^^(-a)); ModInt t2 = this, te = ModInt(1); for (long e = a; e > 0; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op: "-")() const { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0); } string toString() const { return x.to!string; } } enum MO = 1_000_000_007; alias Mint = ModInt!MO; int N; int[] A, B; int[][] G; int[] par; Mint[][] dp, DP; void dfs(int u, int p) { par[u] = p; foreach (i; G[u]) { const v = A[i] ^ B[i] ^ u; if (v != p) { dfs(v, u); } } auto crt = [Mint(1), Mint(0)]; foreach (i; G[u]) { const v = A[i] ^ B[i] ^ u; if (v != p) { auto nxt = new Mint[2]; nxt[0] += crt[0] * (2 * dp[v][0]); nxt[1] += crt[0] * dp[v][1]; nxt[1] += crt[1] * (2 * dp[v][0]); crt = nxt; } } dp[u] = crt; dp[u][1] += dp[u][0]; } void DFS(int u, int p) { int[] vs; foreach (i; G[u]) { const v = A[i] ^ B[i] ^ u; if (v != p) { vs ~= v; } } const len = cast(int)(vs.length); auto ls = new Mint[][](len + 1, 2); auto rs = new Mint[][](len + 1, 2); ls[0] = (p != -1) ? [2 * DP[u][0], DP[u][1]] : [Mint(1), Mint(0)]; foreach (j; 0 .. len) { ls[j + 1][0] += ls[j][0] * (2 * dp[vs[j]][0]); ls[j + 1][1] += ls[j][0] * dp[vs[j]][1]; ls[j + 1][1] += ls[j][1] * (2 * dp[vs[j]][0]); } rs[len] = [Mint(1), Mint(0)]; foreach_reverse (j; 0 .. len) { rs[j][0] += rs[j + 1][0] * (2 * dp[vs[j]][0]); rs[j][1] += rs[j + 1][0] * dp[vs[j]][1]; rs[j][1] += rs[j + 1][1] * (2 * dp[vs[j]][0]); } foreach (j; 0 .. len) { DP[vs[j]] = new Mint[2]; DP[vs[j]][0] += ls[j][0] * rs[j + 1][0]; DP[vs[j]][1] += ls[j][0] * rs[j + 1][1]; DP[vs[j]][1] += ls[j][1] * rs[j + 1][0]; DP[vs[j]][1] += DP[vs[j]][0]; } foreach (i; G[u]) { const v = A[i] ^ B[i] ^ u; if (v != p) { DFS(v, u); } } } void main() { try { for (; ; ) { N = readInt(); A = new int[N - 1]; B = new int[N - 1]; foreach (i; 0 .. N - 1) { A[i] = readInt() - 1; B[i] = readInt() - 1; } G = new int[][N]; foreach (i; 0 .. N - 1) { G[A[i]] ~= i; G[B[i]] ~= i; } par = new int[N]; dp = new Mint[][N]; DP = new Mint[][N]; const rt = 0; dfs(rt, -1); DFS(rt, -1); debug { writeln("dp = ", dp); writeln("DP = ", DP); } Mint ans; foreach (u; 0 .. N) { auto crt = new Mint[4]; crt[0] = 1; if (par[u] != -1) { auto nxt = new Mint[4]; foreach (x; 0 .. 4) { nxt[x] += crt[x] * (2 * DP[u][0]); if (x + 1 < 4) { nxt[x + 1] += crt[x] * DP[u][1]; } } crt = nxt; } foreach (i; G[u]) { const v = A[i] ^ B[i] ^ u; if (v != par[u]) { auto nxt = new Mint[4]; foreach (x; 0 .. 4) { nxt[x] += crt[x] * (2 * dp[v][0]); if (x + 1 < 4) { nxt[x + 1] += crt[x] * dp[v][1]; } } crt = nxt; } } debug { writeln(u, ": ", crt); } ans += 6 * crt[3]; ans += 6 * crt[2]; ans += 3 * crt[1]; ans += 1 * crt[0]; } writeln(ans); } } catch (EOFException e) { } }