結果
問題 | No.1718 Random Squirrel |
ユーザー | puzneko |
提出日時 | 2021-11-16 00:24:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 483 ms / 2,000 ms |
コード長 | 2,947 bytes |
コンパイル時間 | 299 ms |
コンパイル使用メモリ | 86,852 KB |
実行使用メモリ | 139,528 KB |
最終ジャッジ日時 | 2023-08-21 19:24:59 |
合計ジャッジ時間 | 10,569 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,208 KB |
testcase_01 | AC | 72 ms
71,268 KB |
testcase_02 | AC | 72 ms
71,328 KB |
testcase_03 | AC | 71 ms
70,904 KB |
testcase_04 | AC | 73 ms
71,272 KB |
testcase_05 | AC | 73 ms
71,016 KB |
testcase_06 | AC | 71 ms
71,012 KB |
testcase_07 | AC | 73 ms
71,240 KB |
testcase_08 | AC | 73 ms
70,900 KB |
testcase_09 | AC | 73 ms
71,264 KB |
testcase_10 | AC | 72 ms
71,236 KB |
testcase_11 | AC | 368 ms
105,276 KB |
testcase_12 | AC | 209 ms
85,564 KB |
testcase_13 | AC | 307 ms
99,516 KB |
testcase_14 | AC | 344 ms
105,572 KB |
testcase_15 | AC | 327 ms
111,632 KB |
testcase_16 | AC | 262 ms
93,636 KB |
testcase_17 | AC | 320 ms
104,988 KB |
testcase_18 | AC | 405 ms
122,612 KB |
testcase_19 | AC | 346 ms
111,048 KB |
testcase_20 | AC | 229 ms
89,924 KB |
testcase_21 | AC | 460 ms
115,844 KB |
testcase_22 | AC | 483 ms
129,060 KB |
testcase_23 | AC | 443 ms
115,748 KB |
testcase_24 | AC | 447 ms
115,876 KB |
testcase_25 | AC | 470 ms
128,972 KB |
testcase_26 | AC | 280 ms
139,528 KB |
testcase_27 | AC | 275 ms
120,132 KB |
testcase_28 | AC | 268 ms
139,328 KB |
testcase_29 | AC | 285 ms
115,972 KB |
testcase_30 | AC | 285 ms
115,880 KB |
testcase_31 | AC | 260 ms
116,044 KB |
testcase_32 | AC | 283 ms
115,752 KB |
ソースコード
from sys import stdin n, m, *indata = map(int, stdin.read().split()) offset = 0 g = [[] for i in range(n+1)] for i in range(n-1): s, t = indata[offset + 2*i],indata[offset + 2*i+1] g[s].append((t,i)) g[t].append((s,i)) offset += (n-1)*2 d = [False for i in range(n+1)] for i in range(m): d[indata[offset + i]] = True que = [(1,0)] dp = [-1 for i in range(n+1)] dpdist = [-1 for i in range(n+1)] check = [0 for i in range(n+1)] while que: now, inout = que.pop() if inout == 0: check[now] = 1 que.append((now,1)) for i, ind in g[now]: if check[i] == 0: que.append((i,0)) else: kari = -1 distmax = -1 check[now] = 2 for i, ind in g[now]: if check[i] == 2: if dp[i] != -1: kari += dp[i] + 2 distmax = max(distmax,dpdist[i]) if kari != -1: kari += 1 distmax += 1 else: if d[now]: kari = 0 distmax = max(distmax,0) dp[now] = kari dpdist[now] = distmax dp2 = [-1 for i in range(n+1)] dpdist2 = [-1 for i in range(n+1)] que = [(1,-1)] check = [False for i in range(n+1)] while que: now, come = que.pop() check[now] = True ruiseki = [0] ruisekidist = [-1] for i, ind in g[now]: kari = ruiseki[-1] distmax = ruisekidist[-1] if ind != come: if dpdist[i] != -1: kari = kari + dp[i] + 2 distmax = max(distmax,dpdist[i]) else: if dpdist2[ind] != -1: kari = kari + dp2[ind] + 2 distmax = max(distmax,dpdist2[ind]) ruiseki.append(kari) ruisekidist.append(distmax) ruiseki2 = [0] ruisekidist2 = [-1] for i, ind in reversed(g[now]): kari = ruiseki2[-1] distmax = ruisekidist2[-1] if ind != come: if dpdist[i] != -1: kari = kari + dp[i] + 2 distmax = max(distmax,dpdist[i]) else: if dpdist2[ind] != -1: kari = kari + dp2[ind] + 2 distmax = max(distmax,dpdist2[ind]) ruiseki2.append(kari) ruisekidist2.append(distmax) dp[now] = ruiseki[-1] dpdist[now] = ruisekidist[-1] + 1 val = 0 for i, ind in g[now]: if ind != come: kari = ruiseki[val] + ruiseki2[-2-val] distmax = max(ruisekidist[val], ruisekidist2[-2-val]) dp2[ind] = kari if distmax != -1: dpdist2[ind] = distmax + 1 else: if d[now]: dpdist2[ind] = 0 else: dpdist2[ind] = -1 val += 1 for i, ind in g[now]: if not check[i]: que.append((i, ind)) for i in range(1,n+1): ans = dp[i] - dpdist[i] print("{}".format(ans))