結果
問題 | No.1333 Squared Sum |
ユーザー | mkawa2 |
提出日時 | 2023-08-11 09:49:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 496 ms / 2,000 ms |
コード長 | 1,701 bytes |
コンパイル時間 | 161 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 150,160 KB |
最終ジャッジ日時 | 2024-04-29 02:20:07 |
合計ジャッジ時間 | 15,507 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
52,480 KB |
testcase_01 | AC | 37 ms
52,224 KB |
testcase_02 | AC | 38 ms
52,480 KB |
testcase_03 | AC | 452 ms
124,800 KB |
testcase_04 | AC | 429 ms
125,060 KB |
testcase_05 | AC | 416 ms
126,592 KB |
testcase_06 | AC | 426 ms
125,056 KB |
testcase_07 | AC | 404 ms
126,536 KB |
testcase_08 | AC | 470 ms
136,932 KB |
testcase_09 | AC | 421 ms
124,800 KB |
testcase_10 | AC | 450 ms
124,800 KB |
testcase_11 | AC | 441 ms
124,800 KB |
testcase_12 | AC | 438 ms
124,928 KB |
testcase_13 | AC | 356 ms
124,160 KB |
testcase_14 | AC | 483 ms
138,664 KB |
testcase_15 | AC | 478 ms
138,656 KB |
testcase_16 | AC | 34 ms
52,608 KB |
testcase_17 | AC | 31 ms
52,352 KB |
testcase_18 | AC | 32 ms
52,608 KB |
testcase_19 | AC | 32 ms
52,224 KB |
testcase_20 | AC | 31 ms
52,608 KB |
testcase_21 | AC | 33 ms
52,480 KB |
testcase_22 | AC | 32 ms
52,224 KB |
testcase_23 | AC | 33 ms
52,096 KB |
testcase_24 | AC | 33 ms
52,480 KB |
testcase_25 | AC | 32 ms
52,608 KB |
testcase_26 | AC | 496 ms
137,520 KB |
testcase_27 | AC | 471 ms
137,380 KB |
testcase_28 | AC | 487 ms
137,256 KB |
testcase_29 | AC | 355 ms
126,208 KB |
testcase_30 | AC | 185 ms
98,440 KB |
testcase_31 | AC | 127 ms
87,688 KB |
testcase_32 | AC | 250 ms
104,452 KB |
testcase_33 | AC | 223 ms
109,696 KB |
testcase_34 | AC | 354 ms
125,764 KB |
testcase_35 | AC | 288 ms
106,792 KB |
testcase_36 | AC | 169 ms
95,616 KB |
testcase_37 | AC | 176 ms
96,144 KB |
testcase_38 | AC | 186 ms
96,664 KB |
testcase_39 | AC | 288 ms
108,600 KB |
testcase_40 | AC | 367 ms
146,184 KB |
testcase_41 | AC | 348 ms
147,520 KB |
testcase_42 | AC | 374 ms
146,696 KB |
testcase_43 | AC | 366 ms
150,160 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = -1-(-1 << 63) md = 10**9+7 # md = 998244353 n = II() to = [[] for _ in range(n)] for _ in range(n-1): u, v, w = LI1() w += 1 to[u].append((v, w)) to[v].append((u, w)) def dfs(root=0): uu, stack = [], [root] while stack: u = stack.pop() uu.append(u) for v, w in to[u]: if v == parent[u]: continue ww[v] = w parent[v] = u depth[v] = depth[u]+1 stack.append(v) return uu parent, depth, ww = [-1]*n, [0]*n, [0]*n uu = dfs() dp = [[1, 0, 0] for _ in range(n)] ans = 0 for u in uu[:0:-1]: w = ww[u] w2 = w*w%md v = parent[u] dpu = dp[u] dpv = dp[v] ans += dpu[2]*dpv[0]%md+dpv[2]*dpu[0]%md+w2*dpu[0]%md*dpv[0]%md+2*dpu[1]*dpv[1]%md+2*w*( dpu[1]*dpv[0]%md+dpv[1]*dpu[0]%md)%md ans %= md dpv[0] += dpu[0] dpv[1] += dpu[1]+w*dpu[0]%md dpv[2] += dpu[2]+2*w*dpu[1]%md+pow(w, 2, md)*dpu[0]%md dpv[1] %= md dpv[2] %= md print(ans)