結果

問題 No.2258 The Jikka Tree
ユーザー qwewe
提出日時 2025-05-14 12:51:46
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,094 bytes
コンパイル時間 524 ms
コンパイル使用メモリ 82,700 KB
実行使用メモリ 77,704 KB
最終ジャッジ日時 2025-05-14 12:52:59
合計ジャッジ時間 10,047 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 2 TLE * 1 -- * 72
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from sys import stdin
from collections import deque

sys.setrecursionlimit(1 << 25)

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr +=1

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

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

    q = deque()
    q.append(0)
    parent[0][0] = -1
    while q:
        u = q.popleft()
        for v in edges[u]:
            if parent[0][v] == -1 and v != parent[0][u]:
                parent[0][v] = u
                depth[v] = depth[u] +1
                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] != parent[k][v]:
                u = parent[k][u]
                v = parent[k][v]
        return parent[0][u]

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

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

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

    prefix_A = [0]*(N+1)
    prefix_Adepth = [0]*(N+1)
    prefix_depth = [0]*(N+1)
    for i in range(N):
        prefix_A[i+1] = prefix_A[i] + A[i]
        prefix_Adepth[i+1] = prefix_Adepth[i] + A[i] * depth[i]
        prefix_depth[i+1] = prefix_depth[i] + depth[i]

    X = []
    sum_X = 0
    for i in range(Q):
        a_prime, b_prime, k_prime, delta = queries[i]
        if i ==0:
            a = a_prime
            b = b_prime
            k = k_prime
        else:
            a = (a_prime + sum_X) % N
            b = (b_prime + 2*sum_X) % N
            k = (k_prime + sum_X * sum_X) % 150001
        l = min(a, b)
        r = 1 + max(a, b)
        delta_i = delta

        sum_A = prefix_A[r] - prefix_A[l]
        sum_Adepth = prefix_Adepth[r] - prefix_Adepth[l]
        sum_depth = prefix_depth[r] - prefix_depth[l]
        total_weight = sum_A + k * (r - l)

        min_val = float('inf')
        best_v = -1
        for v in range(l, r):
            s = 0
            for w in range(l, r):
                d = depth[v] + depth[w] - 2 * depth[lca(v, w)]
                s += (A[w] + k) * d
            s += 1e-100 * (depth[v] + depth[delta_i] - 2 * depth[lca(v, delta_i)])
            if s < min_val:
                min_val = s
                best_v = v
        X.append(best_v)
        sum_X += best_v

    for x in X:
        print(x)

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