結果

問題 No.2949 Product on Tree
ユーザー 👑 hos.lyrichos.lyric
提出日時 2024-10-25 22:19:11
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 340 ms / 2,000 ms
コード長 3,932 bytes
コンパイル時間 1,542 ms
コンパイル使用メモリ 153,284 KB
実行使用メモリ 31,672 KB
最終ジャッジ日時 2024-10-25 22:19:32
合計ジャッジ時間 18,328 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 1 ms
6,820 KB
testcase_03 AC 291 ms
17,356 KB
testcase_04 AC 311 ms
17,372 KB
testcase_05 AC 296 ms
17,168 KB
testcase_06 AC 300 ms
18,172 KB
testcase_07 AC 292 ms
16,628 KB
testcase_08 AC 326 ms
17,856 KB
testcase_09 AC 297 ms
18,796 KB
testcase_10 AC 301 ms
18,144 KB
testcase_11 AC 305 ms
19,540 KB
testcase_12 AC 300 ms
20,912 KB
testcase_13 AC 302 ms
21,768 KB
testcase_14 AC 293 ms
23,288 KB
testcase_15 AC 302 ms
25,608 KB
testcase_16 AC 309 ms
24,372 KB
testcase_17 AC 309 ms
24,292 KB
testcase_18 AC 303 ms
24,028 KB
testcase_19 AC 326 ms
26,348 KB
testcase_20 AC 312 ms
25,268 KB
testcase_21 AC 309 ms
27,136 KB
testcase_22 AC 299 ms
26,588 KB
testcase_23 AC 329 ms
18,676 KB
testcase_24 AC 309 ms
16,960 KB
testcase_25 AC 303 ms
17,476 KB
testcase_26 AC 296 ms
18,232 KB
testcase_27 AC 340 ms
17,988 KB
testcase_28 AC 302 ms
18,856 KB
testcase_29 AC 306 ms
18,320 KB
testcase_30 AC 301 ms
18,684 KB
testcase_31 AC 308 ms
19,812 KB
testcase_32 AC 314 ms
20,232 KB
testcase_33 AC 308 ms
23,320 KB
testcase_34 AC 320 ms
27,712 KB
testcase_35 AC 314 ms
24,444 KB
testcase_36 AC 323 ms
29,324 KB
testcase_37 AC 325 ms
29,976 KB
testcase_38 AC 316 ms
27,100 KB
testcase_39 AC 312 ms
27,188 KB
testcase_40 AC 325 ms
31,672 KB
testcase_41 AC 319 ms
27,592 KB
testcase_42 AC 322 ms
31,576 KB
testcase_43 AC 154 ms
16,232 KB
testcase_44 AC 160 ms
15,324 KB
testcase_45 AC 203 ms
16,668 KB
testcase_46 AC 192 ms
17,240 KB
testcase_47 AC 133 ms
17,124 KB
testcase_48 AC 185 ms
16,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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;
Mint[] C;
int[] A, B;

int[][] graph;
Mint[] dp;
Mint ans;

void dfs(int u, int p) {
  Mint sum = 1;
  Mint here;
  foreach (v; graph[u]) if (p != v) {
    dfs(v, u);
    here += sum * dp[v];
    sum += dp[v];
  }
  dp[u] = C[u] * sum;
  ans += C[u] * here;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      C = new Mint[N];
      foreach (u; 0 .. N) {
        C[u] = readInt;
      }
      auto A = new int[N - 1];
      auto B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      dp = new Mint[N];
      ans = 0;
      dfs(0, -1);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0