結果
問題 | No.2598 Kadomatsu on Tree |
ユーザー | 👑 hos.lyric |
提出日時 | 2024-01-02 00:10:42 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 414 ms / 2,000 ms |
コード長 | 2,365 bytes |
コンパイル時間 | 3,466 ms |
コンパイル使用メモリ | 108,800 KB |
実行使用メモリ | 37,496 KB |
最終ジャッジ日時 | 2024-01-02 00:11:04 |
合計ジャッジ時間 | 21,770 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,676 KB |
testcase_01 | AC | 1 ms
6,676 KB |
testcase_02 | AC | 1 ms
6,676 KB |
testcase_03 | AC | 1 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 1 ms
6,676 KB |
testcase_06 | AC | 2 ms
6,676 KB |
testcase_07 | AC | 1 ms
6,676 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 1 ms
6,676 KB |
testcase_10 | AC | 1 ms
6,676 KB |
testcase_11 | AC | 1 ms
6,676 KB |
testcase_12 | AC | 1 ms
6,676 KB |
testcase_13 | AC | 10 ms
6,676 KB |
testcase_14 | AC | 10 ms
6,676 KB |
testcase_15 | AC | 8 ms
6,676 KB |
testcase_16 | AC | 10 ms
6,676 KB |
testcase_17 | AC | 5 ms
6,676 KB |
testcase_18 | AC | 8 ms
6,676 KB |
testcase_19 | AC | 9 ms
6,676 KB |
testcase_20 | AC | 6 ms
6,676 KB |
testcase_21 | AC | 6 ms
6,676 KB |
testcase_22 | AC | 9 ms
6,676 KB |
testcase_23 | AC | 392 ms
25,496 KB |
testcase_24 | AC | 411 ms
24,560 KB |
testcase_25 | AC | 405 ms
25,516 KB |
testcase_26 | AC | 413 ms
25,696 KB |
testcase_27 | AC | 395 ms
25,752 KB |
testcase_28 | AC | 395 ms
25,772 KB |
testcase_29 | AC | 412 ms
25,804 KB |
testcase_30 | AC | 400 ms
24,468 KB |
testcase_31 | AC | 398 ms
24,240 KB |
testcase_32 | AC | 407 ms
27,128 KB |
testcase_33 | AC | 404 ms
27,724 KB |
testcase_34 | AC | 394 ms
24,856 KB |
testcase_35 | AC | 404 ms
27,772 KB |
testcase_36 | AC | 397 ms
26,188 KB |
testcase_37 | AC | 397 ms
25,348 KB |
testcase_38 | AC | 411 ms
25,360 KB |
testcase_39 | AC | 408 ms
26,104 KB |
testcase_40 | AC | 403 ms
25,852 KB |
testcase_41 | AC | 402 ms
25,572 KB |
testcase_42 | AC | 394 ms
25,272 KB |
testcase_43 | AC | 414 ms
26,120 KB |
testcase_44 | AC | 410 ms
25,692 KB |
testcase_45 | AC | 408 ms
25,852 KB |
testcase_46 | AC | 412 ms
25,784 KB |
testcase_47 | AC | 404 ms
24,492 KB |
testcase_48 | AC | 400 ms
37,496 KB |
testcase_49 | AC | 30 ms
6,920 KB |
testcase_50 | AC | 246 ms
26,632 KB |
testcase_51 | AC | 61 ms
9,044 KB |
testcase_52 | AC | 112 ms
11,476 KB |
testcase_53 | AC | 123 ms
12,452 KB |
testcase_54 | AC | 101 ms
10,068 KB |
testcase_55 | AC | 38 ms
6,676 KB |
testcase_56 | AC | 186 ms
18,132 KB |
testcase_57 | AC | 68 ms
7,892 KB |
testcase_58 | AC | 311 ms
21,348 KB |
testcase_59 | AC | 308 ms
21,040 KB |
testcase_60 | AC | 353 ms
32,032 KB |
testcase_61 | AC | 367 ms
36,252 KB |
testcase_62 | AC | 361 ms
30,604 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; } 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)); } enum MO = 998244353; int N; int[] A, B; int[] C; int[][] graph; int[] par, sz; void dfs(int u, int p) { par[u] = p; sz[u] = 1; foreach (v; graph[u]) if (p != v) { dfs(v, u); sz[u] += sz[v]; } } 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; } C = new int[N]; foreach (u; 0 .. N) { C[u] = readInt; } graph = new int[][N]; foreach (i; 0 .. N - 1) { graph[A[i]] ~= B[i]; graph[B[i]] ~= A[i]; } par = new int[N]; sz = new int[N]; dfs(0, -1); long ans; foreach (u; 0 .. N) { int[][2] xss; foreach (v; graph[u]) { const x = (v == par[u]) ? (N - sz[u]) : sz[v]; if (C[u] > C[v]) xss[0] ~= x; if (C[u] < C[v]) xss[1] ~= x; } foreach (h; 0 .. 2) { long sum; foreach (x; xss[h]) { ans += sum * x; sum += x; } } } writeln(ans % MO); } } catch (EOFException e) { } }