結果
問題 | No.1295 木と駒 |
ユーザー | Kiri8128 |
提出日時 | 2020-11-23 16:23:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 378 ms / 2,000 ms |
コード長 | 2,398 bytes |
コンパイル時間 | 536 ms |
コンパイル使用メモリ | 86,764 KB |
実行使用メモリ | 116,684 KB |
最終ジャッジ日時 | 2023-09-30 23:53:53 |
合計ジャッジ時間 | 14,629 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 87 ms
71,576 KB |
testcase_01 | AC | 94 ms
71,700 KB |
testcase_02 | AC | 96 ms
76,104 KB |
testcase_03 | AC | 88 ms
71,664 KB |
testcase_04 | AC | 88 ms
71,720 KB |
testcase_05 | AC | 88 ms
71,600 KB |
testcase_06 | AC | 89 ms
71,556 KB |
testcase_07 | AC | 92 ms
71,724 KB |
testcase_08 | AC | 87 ms
71,464 KB |
testcase_09 | AC | 88 ms
71,628 KB |
testcase_10 | AC | 86 ms
71,584 KB |
testcase_11 | AC | 86 ms
71,508 KB |
testcase_12 | AC | 87 ms
71,768 KB |
testcase_13 | AC | 88 ms
71,720 KB |
testcase_14 | AC | 333 ms
101,608 KB |
testcase_15 | AC | 315 ms
102,752 KB |
testcase_16 | AC | 320 ms
103,692 KB |
testcase_17 | AC | 330 ms
105,244 KB |
testcase_18 | AC | 325 ms
104,764 KB |
testcase_19 | AC | 273 ms
107,696 KB |
testcase_20 | AC | 267 ms
105,372 KB |
testcase_21 | AC | 297 ms
108,336 KB |
testcase_22 | AC | 292 ms
107,248 KB |
testcase_23 | AC | 310 ms
107,504 KB |
testcase_24 | AC | 315 ms
107,204 KB |
testcase_25 | AC | 282 ms
108,624 KB |
testcase_26 | AC | 218 ms
104,756 KB |
testcase_27 | AC | 228 ms
105,380 KB |
testcase_28 | AC | 315 ms
105,252 KB |
testcase_29 | AC | 233 ms
105,536 KB |
testcase_30 | AC | 229 ms
105,380 KB |
testcase_31 | AC | 229 ms
105,040 KB |
testcase_32 | AC | 305 ms
104,788 KB |
testcase_33 | AC | 312 ms
105,200 KB |
testcase_34 | AC | 378 ms
106,404 KB |
testcase_35 | AC | 309 ms
105,192 KB |
testcase_36 | AC | 302 ms
105,192 KB |
testcase_37 | AC | 316 ms
105,616 KB |
testcase_38 | AC | 335 ms
106,448 KB |
testcase_39 | AC | 291 ms
105,232 KB |
testcase_40 | AC | 306 ms
105,400 KB |
testcase_41 | AC | 262 ms
108,196 KB |
testcase_42 | AC | 272 ms
116,684 KB |
testcase_43 | AC | 267 ms
107,716 KB |
testcase_44 | AC | 269 ms
116,300 KB |
testcase_45 | AC | 267 ms
109,780 KB |
testcase_46 | AC | 274 ms
109,440 KB |
testcase_47 | AC | 269 ms
109,528 KB |
testcase_48 | AC | 272 ms
107,788 KB |
ソースコード
import sys input = sys.stdin.readline from collections import deque N = int(input()) X = [[] for i in range(N)] for i in range(N-1): x, y = map(int, input().split()) x, y = x-1, y-1 X[x].append(y) X[y].append(x) MI = [min(x) for x in X] MA = [max(x) for x in X] MA2 = [max([y for y in x + [-1] if y != ma]) for x, ma in zip(X, MA)] if False: print("MI =", MI) print("MA =", MA) print("MA2 =", MA2) P = [-1] * N Q = deque([0]) R = [] while Q: i = deque.popleft(Q) R.append(i) for a in X[i]: if a != P[i]: P[a] = i X[a].remove(i) deque.append(Q, a) ##### Settings unit = 0 merge = lambda a, b: a + b ## ↓ この2つは必ず対称的にする(じゃないとバグる) adj_bu = lambda a, i: a * inv(SIZE[i]) % mod adj_td = lambda a, i, p: a * inv(N-SIZE[i]) % mod # SIZEのときはi、それ以外の頂点情報のときはpを使う def adj_bu(a, i, p): if a >= 4: return 4 if a == 0 and p == MI[i]: return 0 if a == 3 and p != MA[i]: return 4 if i == MA[p] or i == MI[p]: return 2 if i == MA2[p]: return 3 return 4 def adj_td(a, i, p): return adj_bu(a, p, i) adj_fin = lambda a, i: "Yes" if a <= 2 else "No" ##### if False: nn = 200200 fa = [1] * (nn+1) fainv = [1] * (nn+1) for i in range(nn): fa[i+1] = fa[i] * (i+1) % mod fainv[-1] = pow(fa[-1], mod-2, mod) for i in range(nn)[::-1]: fainv[i] = fainv[i+1] * (i+1) % mod inv = lambda i: fainv[i] * fa[i-1] % mod print("fa =", fa[:20]) print("fainv =", fainv[:20]) if False: SIZE = [1] * N for i in R[1:][::-1]: SIZE[P[i]] += SIZE[i] print("SIZE =", SIZE) # Size of subtree ME = [unit] * N XX = [0] * N TD = [unit] * N for i in R[1:][::-1]: p = P[i] XX[i] = adj_bu(ME[i], i, p) #################### ME[p] = merge(ME[p], XX[i]) XX[R[0]] = adj_fin(ME[R[0]], R[0]) if False: print("ME =", ME) # Merge before adj print("XX =", XX) # Bottom-up after adj for i in R: ac = TD[i] for j in X[i]: TD[j] = ac ac = merge(ac, XX[j]) ac = unit for j in X[i][::-1]: TD[j] = adj_td(merge(TD[j], ac), j, i) ac = merge(ac, XX[j]) XX[j] = adj_fin(merge(ME[j], TD[j]), j) if False: print("TD =", TD) # Top-down after adj print("XX =", XX) # Final Result print("\n".join(XX))