結果

問題 No.2258 The Jikka Tree
ユーザー gew1fw
提出日時 2025-06-12 17:10:25
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,699 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 78,152 KB
最終ジャッジ日時 2025-06-12 17:10:38
合計ジャッジ時間 8,952 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 2 TLE * 1 -- * 72
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from bisect import bisect_left

def main():
    sys.setrecursionlimit(1 << 25)
    input = sys.stdin.read
    data = input().split()
    ptr = 0

    N = int(data[ptr])
    ptr += 1

    edges = [[] for _ in range(N)]
    for _ in range(N-1):
        u = int(data[ptr])
        v = int(data[ptr+1])
        ptr += 2
        edges[u].append(v)
        edges[v].append(u)

    A = list(map(int, data[ptr:ptr+N]))
    ptr += N

    Q = int(data[ptr])
    ptr += 1

    queries = []
    for _ in range(Q):
        a_prime = int(data[ptr])
        b_prime = int(data[ptr+1])
        k_prime = int(data[ptr+2])
        delta = int(data[ptr+3])
        ptr += 4
        queries.append((a_prime, b_prime, k_prime, delta))

    LOG = 20
    parent = [[-1]*N for _ in range(LOG)]
    depth = [0]*N
    visited = [False]*N

    from collections import deque
    q = deque()
    q.append(0)
    visited[0] = True
    parent[0][0] = -1
    while q:
        u = q.popleft()
        for v in edges[u]:
            if not visited[v]:
                visited[v] = True
                depth[v] = depth[u] + 1
                parent[0][v] = u
                q.append(v)

    for k in range(1, LOG):
        for v in range(N):
            if parent[k-1][v] != -1:
                parent[k][v] = parent[k-1][parent[k-1][v]]
            else:
                parent[k][v] = -1

    def lca(u, v):
        if depth[u] < depth[v]:
            u, v = v, u
        for k in range(LOG-1, -1, -1):
            if depth[u] - (1 << k) >= depth[v]:
                u = parent[k][u]
        if u == v:
            return u
        for k in range(LOG-1, -1, -1):
            if parent[k][u] != -1 and parent[k][u] != parent[k][v]:
                u = parent[k][u]
                v = parent[k][v]
        return parent[0][u]

    def dist(u, v):
        return depth[u] + depth[v] - 2 * depth[lca(u, v)]

    X = []
    for i in range(Q):
        a_prime, b_prime, k_prime, delta = queries[i]
        a = a_prime
        b = b_prime
        if i > 0:
            sum_x = sum(X)
            a = (a_prime + sum_x) % N
            b = (b_prime + 2 * sum_x) % N
            k = (k_prime + sum_x ** 2) % 150001
        else:
            k = k_prime

        l = min(a, b)
        r = max(a, b) + 1
        S = list(range(l, r))

        best_v = -1
        min_f = float('inf')

        for v in S:
            total = 0
            for w in S:
                total += (A[w] + k) * dist(v, w)
            total += 1e-100 * dist(v, delta)
            if total < min_f:
                min_f = total
                best_v = v

        X.append(best_v)

    for x in X:
        print(x)

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