結果
問題 | No.2115 Making Forest Easy |
ユーザー | 👑 ygussany |
提出日時 | 2022-10-29 00:47:30 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 1,690 ms / 2,000 ms |
コード長 | 2,723 bytes |
コンパイル時間 | 1,372 ms |
コンパイル使用メモリ | 32,888 KB |
実行使用メモリ | 119,500 KB |
最終ジャッジ日時 | 2023-09-20 08:00:51 |
合計ジャッジ時間 | 31,216 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1,678 ms
119,304 KB |
testcase_03 | AC | 440 ms
119,460 KB |
testcase_04 | AC | 1,240 ms
119,100 KB |
testcase_05 | AC | 895 ms
103,760 KB |
testcase_06 | AC | 1,649 ms
119,272 KB |
testcase_07 | AC | 361 ms
119,300 KB |
testcase_08 | AC | 1,661 ms
119,272 KB |
testcase_09 | AC | 291 ms
119,324 KB |
testcase_10 | AC | 1,658 ms
119,500 KB |
testcase_11 | AC | 307 ms
119,120 KB |
testcase_12 | AC | 300 ms
119,372 KB |
testcase_13 | AC | 204 ms
109,640 KB |
testcase_14 | AC | 287 ms
119,296 KB |
testcase_15 | AC | 376 ms
119,412 KB |
testcase_16 | AC | 286 ms
119,416 KB |
testcase_17 | AC | 16 ms
13,400 KB |
testcase_18 | AC | 264 ms
23,412 KB |
testcase_19 | AC | 850 ms
67,636 KB |
testcase_20 | AC | 315 ms
99,848 KB |
testcase_21 | AC | 85 ms
12,916 KB |
testcase_22 | AC | 76 ms
27,328 KB |
testcase_23 | AC | 1,097 ms
91,744 KB |
testcase_24 | AC | 304 ms
119,360 KB |
testcase_25 | AC | 414 ms
54,084 KB |
testcase_26 | AC | 287 ms
119,280 KB |
testcase_27 | AC | 181 ms
66,208 KB |
testcase_28 | AC | 347 ms
119,320 KB |
testcase_29 | AC | 170 ms
16,740 KB |
testcase_30 | AC | 378 ms
119,236 KB |
testcase_31 | AC | 1,228 ms
119,248 KB |
testcase_32 | AC | 1,686 ms
119,372 KB |
testcase_33 | AC | 1,690 ms
119,288 KB |
testcase_34 | AC | 29 ms
18,228 KB |
testcase_35 | AC | 363 ms
30,148 KB |
testcase_36 | AC | 1,686 ms
119,120 KB |
testcase_37 | AC | 149 ms
63,272 KB |
testcase_38 | AC | 61 ms
36,204 KB |
testcase_39 | AC | 662 ms
51,384 KB |
testcase_40 | AC | 348 ms
119,248 KB |
testcase_41 | AC | 290 ms
119,284 KB |
testcase_42 | AC | 260 ms
119,324 KB |
testcase_43 | AC | 161 ms
56,360 KB |
testcase_44 | AC | 57 ms
35,956 KB |
testcase_45 | AC | 276 ms
91,552 KB |
testcase_46 | AC | 226 ms
119,076 KB |
testcase_47 | AC | 148 ms
50,188 KB |
testcase_48 | AC | 1,171 ms
119,356 KB |
testcase_49 | AC | 1,298 ms
119,460 KB |
testcase_50 | AC | 146 ms
75,204 KB |
testcase_51 | AC | 112 ms
50,740 KB |
ソースコード
#include <stdio.h> const int Mod = 998244353; typedef struct Edge { struct Edge *next; int v, id; long long dp[1001]; } edge; long long div_mod(long long x, long long y, long long z) { if (x % y == 0) return x / y; else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y; } int main() { int i, N, M, u, w, A[5001]; edge *adj[5001] = {}, e[10001], *p; scanf("%d", &N); for (u = 1; u <= N; u++) scanf("%d", &(A[u])); for (i = 0; i < N - 1; i++) { scanf("%d %d", &u, &w); e[i*2].v = w; e[i*2+1].v = u; e[i*2].id = i * 2; e[i*2+1].id = i * 2 + 1; e[i*2].next = adj[u]; e[i*2+1].next = adj[w]; adj[u] = &(e[i*2]); adj[w] = &(e[i*2+1]); } int par[5001] = {}, pred[5001], q[5001], head, tail; q[0] = 1; par[1] = 1; pred[1] = -1; for (head = 0, tail = 1; head < tail; head++) { u = q[head]; for (p = adj[u]; p != NULL; p = p->next) { w = p->v; if (par[w] == 0) { par[w] = u; pred[w] = p->id; q[tail++] = w; } } } int k; long long sum; for (head--; head >= 1; head--) { u = q[head]; i = pred[u]; if (adj[u]->next == NULL) { for (k = 0; k < A[u]; k++) e[i].dp[k] = 1; for (k = A[u]; k <= 1000; k++) e[i].dp[k] = 2; continue; } for (p = adj[u], sum = 1; p != NULL; p = p->next) { if (p->v == par[u]) continue; sum = sum * p->dp[1000] % Mod; } e[i].dp[0] = sum; for (k = 1; k < A[u]; k++) e[i].dp[k] = e[i].dp[0]; for (k = A[u]; k <= 1000; k++) { for (p = adj[u], sum = 1; p != NULL; p = p->next) { if (p->v == par[u]) continue; sum = sum * p->dp[k] % Mod; } e[i].dp[k] = (e[i].dp[0] + sum) % Mod; } } long long ans = 0; static long long prod[5001][1001]; for (k = 0; k <= 1000; k++) { for (p = adj[1], prod[1][k] = 1; p != NULL; p = p->next) prod[1][k] = prod[1][k] * p->dp[k] % Mod; if (k > 0) ans += (prod[1][k] - prod[1][k-1] + Mod) * ((k >= A[1])? k: A[1]) % Mod; } ans += prod[1][0] * A[1] % Mod; for (head = 1; head < tail; head++) { w = q[head]; i = pred[w] ^ 1; u = par[w]; if (adj[u]->next == NULL) { for (k = 0; k < A[u]; k++) e[i].dp[k] = 1; for (k = A[u]; k <= 1000; k++) e[i].dp[k] = 2; } else { e[i].dp[0] = div_mod(prod[u][1000], e[i^1].dp[1000], Mod); for (k = 1; k < A[u]; k++) e[i].dp[k] = e[i].dp[0]; for (k = A[u]; k <= 1000; k++) e[i].dp[k] = (e[i].dp[0] + div_mod(prod[u][k], e[i^1].dp[k], Mod)) % Mod; } for (k = 0; k <= 1000; k++) { for (p = adj[w], prod[w][k] = 1; p != NULL; p = p->next) prod[w][k] = prod[w][k] * p->dp[k] % Mod; if (k > 0) ans += (prod[w][k] - prod[w][k-1] + Mod) * ((k >= A[w])? k: A[w]) % Mod; } ans += prod[w][0] * A[w] % Mod; } printf("%lld\n", ans % Mod); fflush(stdout); return 0; }