結果

問題 No.1976 Cut then Connect
ユーザー tamatotamato
提出日時 2022-06-10 22:59:03
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 4,708 bytes
コンパイル時間 303 ms
コンパイル使用メモリ 82,580 KB
実行使用メモリ 133,060 KB
最終ジャッジ日時 2024-09-21 06:45:36
合計ジャッジ時間 6,740 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 AC 44 ms
54,400 KB
testcase_02 WA -
testcase_03 RE -
testcase_04 WA -
testcase_05 WA -
testcase_06 RE -
testcase_07 AC 209 ms
101,284 KB
testcase_08 AC 388 ms
125,240 KB
testcase_09 RE -
testcase_10 WA -
testcase_11 RE -
testcase_12 RE -
testcase_13 AC 291 ms
108,516 KB
testcase_14 RE -
testcase_15 AC 256 ms
103,332 KB
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 WA -
testcase_20 RE -
testcase_21 RE -
testcase_22 AC 43 ms
54,400 KB
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 AC 44 ms
54,528 KB
testcase_29 RE -
testcase_30 WA -
testcase_31 WA -
testcase_32 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 998244353


def main():
    import sys
    from collections import deque
    input = sys.stdin.readline

    def radius(v0, v1):
        que = deque()
        que.append(v0)
        seen = {}
        seen[v0] = 0
        v_last = 0
        while que:
            v = que.popleft()
            for u in adj[v]:
                if u == v1:
                    continue
                if u not in seen:
                    seen[u] = seen[v] + 1
                    que.append(u)
            v_last = v
        v0 = v_last
        que = deque()
        que.append(v0)
        seen = {}
        seen[v0] = 0
        v_last = 0
        while que:
            v = que.popleft()
            for u in adj[v]:
                if u == v1:
                    continue
                if u not in seen:
                    seen[u] = seen[v] + 1
                    que.append(u)
            v_last = v
        return seen[v_last]

    N = int(input())
    adj = [[] for _ in range(N + 1)]
    for _ in range(N - 1):
        a, b = map(int, input().split())
        adj[a].append(b)
        adj[b].append(a)

    que = deque()
    que.append(1)
    seen = [-1] * (N+1)
    seen[1] = 0
    par = [0] * (N+1)
    child = [[] for _ in range(N+1)]
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u in adj[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                child[v].append(u)
                que.append(u)
    seq.reverse()

    v0 = seq[0]
    que = deque()
    que.append(v0)
    seen = [-1] * (N+1)
    seen[v0] = 0
    par = [0] * (N+1)
    child = [[] for _ in range(N+1)]
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u in adj[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                child[v].append(u)
                que.append(u)
    seq.reverse()

    v1 = seq[0]
    D = seen[v1]
    if D & 1:
        v = v1
        for _ in range(D // 2):
            v = par[v]
        vl = v
        vr = par[v]

        dl = radius(vl, vr)
        dr = radius(vr, vl)

        print((dl + 1) // 2 + (dr + 1) // 2 + 1)
    else:
        assert False
        ans = N * 2
        v = v1
        for _ in range(D // 2):
            v = par[v]
        v0 = v
        que = deque()
        que.append(v0)
        seen = [-1] * (N+1)
        seen[v0] = 0
        par = [0] * (N+1)
        child = [[] for _ in range(N+1)]
        seq = []
        while que:
            v = que.popleft()
            seq.append(v)
            for u in adj[v]:
                if seen[u] == -1:
                    seen[u] = seen[v] + 1
                    par[u] = v
                    child[v].append(u)
                    que.append(u)
        seq.reverse()

        subtree_len = [(0, 0)]
        for c in child[v0]:
            que = deque()
            seq = []
            que.append(c)
            while que:
                v = que.popleft()
                for vv in child[v]:
                    que.append(vv)
                seq.append(v)
            subtree_len.append((seen[seq[-1]], c))
        subtree_len.sort(key=lambda x: x[0], reverse=True)

        for c in child[v0]:
            cc = c
            que = deque()
            que.append(cc)
            seen = {}
            seen[cc] = 0
            seq = []
            while que:
                v = que.popleft()
                seq.append(v)
                for u in adj[v]:
                    if u == v0:
                        continue
                    if u not in seen:
                        seen[u] = seen[v] + 1
                        que.append(u)
            seq.reverse()
            cc = seq[0]
            que = deque()
            que.append(cc)
            seen = {}
            seen[cc] = 0
            seq = []
            while que:
                v = que.popleft()
                seq.append(v)
                for u in adj[v]:
                    if u == v0:
                        continue
                    if u not in seen:
                        seen[u] = seen[v] + 1
                        que.append(u)
            seq.reverse()
            dc = seen[seq[0]]

            if c == subtree_len[0][1]:
                dc2 = subtree_len[1][0] + subtree_len[2][0]

            elif c == subtree_len[1][1]:
                dc2 = subtree_len[0][0] + subtree_len[2][0]
            else:
                dc2 = subtree_len[0][0] + subtree_len[1][0]
            ans = min(ans, (dc + 1) // 2 + (dc2 + 1) // 2 + 1)
            #print(cc, ans, dc, dc2)
        print(ans)
        #print(subtree_len)


if __name__ == '__main__':
    main()
0