結果
問題 | No.2360 Path to Integer |
ユーザー |
👑 |
提出日時 | 2023-06-23 22:30:07 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 206 ms / 2,500 ms |
コード長 | 5,668 bytes |
コンパイル時間 | 3,275 ms |
コンパイル使用メモリ | 157,420 KB |
実行使用メモリ | 38,576 KB |
最終ジャッジ日時 | 2024-07-01 02:13:49 |
合計ジャッジ時間 | 6,181 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 15 |
ソースコード
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; }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(uint M_) {import std.conv : to;alias M = M_;uint x;this(ModInt a) { x = a.x; }this(uint x_) { x = x_ % M; }this(ulong x_) { x = cast(uint)(x_ % M); }this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }ref ModInt opOpAssign(string op, T)(T a) {static if (is(T == ModInt)) {static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }else static if (op == "/") { this *= a.inv(); }else static assert(false);return this;} else static if (op == "^^") {if (a < 0) return this = inv()^^(-a);ModInt b = this, c = 1U;for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }return this = c;} else {return mixin("this " ~ op ~ "= ModInt(a)");}}ModInt inv() const {uint a = M, b = x; int y = 0, z = 1;for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }assert(a == 1); return ModInt(y);}ModInt opUnary(string op)() const {static if (op == "+") { return this; }else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }else static assert(false);}ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }bool opCast(T: bool)() const { return (x != 0U); }string toString() const { return x.to!string; }}enum MO = 998244353;alias Mint = ModInt!MO;int N;int[] A, B;string[] S;Mint[] T, X;alias Result = Tuple!(Mint, "sum0", Mint, "sum1");Result add(Result f, Result g) {return Result(f.sum0 + g.sum0, f.sum1 + g.sum1);}Result sub(Result f, Result g) {return Result(f.sum0 - g.sum0, f.sum1 - g.sum1);}Result attach(int u, Result f) {return Result(1 + f.sum0, f.sum1 * T[u] + (1 + f.sum0) * X[u]);}int[][] G;int[] par;Result[] 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);}}// initResult f;foreach (i; G[u]) {const v = A[i] ^ B[i] ^ u;if (v != p) {// add dp[v]f = add(f, dp[v]);}}// calc dp[u]dp[u] = attach(u, f);}void DFS(int u, int p) {// initResult f;foreach (i; G[u]) {const v = A[i] ^ B[i] ^ u;if (v != p) {// add dp[v]f = add(f, dp[v]);}}if (p != -1) {// add DP[u]f = add(f, DP[u]);}foreach (i; G[u]) {const v = A[i] ^ B[i] ^ u;if (v != p) {// calc DP[v], removing dp[v]DP[v] = attach(u, sub(f, dp[v]));}}foreach (i; G[u]) {const v = A[i] ^ B[i] ^ u;if (v != p) {DFS(v, u);}}}void main() {try {for (; ; ) {N = readInt;S = new string[N];foreach (u; 0 .. N) {S[u] = readToken;}A = new int[N - 1];B = new int[N - 1];foreach (i; 0 .. N - 1) {A[i] = readInt - 1;B[i] = readInt - 1;}T = new Mint[N];X = new Mint[N];foreach (u; 0 .. N) {T[u] = Mint(10)^^(cast(int)(S[u].length));X[u] = S[u].to!long;}G = new int[][N];foreach (i; 0 .. N - 1) {G[A[i]] ~= i;G[B[i]] ~= i;}par.length = N;dp.length = N;DP.length = N;const rt = 0;dfs(rt, -1);DFS(rt, -1);debug {writeln("rt = ", rt);writeln("dp = ", dp);writeln("DP = ", DP);}Mint ans;foreach (u; 0 .. N) {// initResult f;foreach (i; G[u]) {const v = A[i] ^ B[i] ^ u;if (v != par[u]) {// add dp[v]f = add(f, dp[v]);}}if (u != rt) {// add DP[u]f = add(f, DP[u]);}// calc ans, rooted at uconst here = attach(u, f);debug {writeln(u, ": ", here);}ans += here.sum1;}writeln(ans);}} catch (EOFException e) {}}