結果
問題 | No.1295 木と駒 |
ユーザー | Kiri8128 |
提出日時 | 2020-11-23 16:28:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 369 ms / 2,000 ms |
コード長 | 1,361 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 86,684 KB |
実行使用メモリ | 117,104 KB |
最終ジャッジ日時 | 2023-09-30 23:54:13 |
合計ジャッジ時間 | 14,300 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
71,520 KB |
testcase_01 | AC | 88 ms
71,492 KB |
testcase_02 | AC | 93 ms
76,192 KB |
testcase_03 | AC | 87 ms
71,556 KB |
testcase_04 | AC | 87 ms
71,852 KB |
testcase_05 | AC | 89 ms
71,508 KB |
testcase_06 | AC | 87 ms
71,716 KB |
testcase_07 | AC | 88 ms
71,348 KB |
testcase_08 | AC | 86 ms
71,904 KB |
testcase_09 | AC | 88 ms
71,712 KB |
testcase_10 | AC | 92 ms
71,632 KB |
testcase_11 | AC | 93 ms
71,816 KB |
testcase_12 | AC | 92 ms
71,508 KB |
testcase_13 | AC | 92 ms
71,640 KB |
testcase_14 | AC | 350 ms
101,036 KB |
testcase_15 | AC | 311 ms
102,536 KB |
testcase_16 | AC | 314 ms
103,128 KB |
testcase_17 | AC | 318 ms
104,480 KB |
testcase_18 | AC | 323 ms
104,968 KB |
testcase_19 | AC | 270 ms
107,344 KB |
testcase_20 | AC | 260 ms
105,628 KB |
testcase_21 | AC | 356 ms
108,540 KB |
testcase_22 | AC | 291 ms
107,032 KB |
testcase_23 | AC | 303 ms
106,908 KB |
testcase_24 | AC | 321 ms
107,144 KB |
testcase_25 | AC | 275 ms
107,844 KB |
testcase_26 | AC | 216 ms
104,512 KB |
testcase_27 | AC | 229 ms
105,276 KB |
testcase_28 | AC | 309 ms
105,088 KB |
testcase_29 | AC | 236 ms
105,380 KB |
testcase_30 | AC | 235 ms
105,228 KB |
testcase_31 | AC | 235 ms
105,308 KB |
testcase_32 | AC | 300 ms
104,296 KB |
testcase_33 | AC | 308 ms
105,348 KB |
testcase_34 | AC | 369 ms
106,444 KB |
testcase_35 | AC | 300 ms
105,340 KB |
testcase_36 | AC | 301 ms
105,164 KB |
testcase_37 | AC | 312 ms
104,692 KB |
testcase_38 | AC | 330 ms
106,444 KB |
testcase_39 | AC | 286 ms
105,276 KB |
testcase_40 | AC | 301 ms
105,308 KB |
testcase_41 | AC | 261 ms
107,972 KB |
testcase_42 | AC | 273 ms
116,620 KB |
testcase_43 | AC | 265 ms
107,812 KB |
testcase_44 | AC | 268 ms
117,104 KB |
testcase_45 | AC | 265 ms
109,656 KB |
testcase_46 | AC | 272 ms
107,916 KB |
testcase_47 | AC | 262 ms
109,868 KB |
testcase_48 | AC | 269 ms
107,476 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)] 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 def adj_bu(a, i, p): if a >= 4 or (a == 3 and p != MA[i]): return 4 if a == 0 and p == MI[i]: return 0 if i == MA[p] or i == MI[p]: return 2 if i == MA2[p]: return 3 return 4 adj_td = lambda a, i, p: adj_bu(a, p, i) adj_fin = lambda a, i: "Yes" if a <= 2 else "No" ##### 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]) 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) print("\n".join(XX))