結果
問題 | No.1094 木登り / Climbing tree |
ユーザー | McGregorsh |
提出日時 | 2023-07-13 00:13:03 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,382 bytes |
コンパイル時間 | 413 ms |
コンパイル使用メモリ | 86,928 KB |
実行使用メモリ | 473,136 KB |
最終ジャッジ日時 | 2023-10-12 14:00:42 |
合計ジャッジ時間 | 50,297 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 262 ms
89,908 KB |
testcase_01 | TLE | - |
testcase_02 | AC | 1,519 ms
473,136 KB |
testcase_03 | AC | 812 ms
105,352 KB |
testcase_04 | AC | 878 ms
155,216 KB |
testcase_05 | AC | 1,222 ms
212,324 KB |
testcase_06 | AC | 1,128 ms
142,792 KB |
testcase_07 | TLE | - |
testcase_08 | TLE | - |
testcase_09 | AC | 1,991 ms
228,172 KB |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | AC | 1,993 ms
224,848 KB |
testcase_13 | AC | 1,992 ms
236,216 KB |
testcase_14 | AC | 1,932 ms
220,172 KB |
testcase_15 | AC | 973 ms
177,624 KB |
testcase_16 | AC | 1,623 ms
383,544 KB |
testcase_17 | AC | 1,233 ms
250,240 KB |
testcase_18 | AC | 1,142 ms
211,204 KB |
testcase_19 | AC | 1,357 ms
319,444 KB |
testcase_20 | AC | 1,960 ms
224,712 KB |
testcase_21 | AC | 1,274 ms
276,832 KB |
testcase_22 | TLE | - |
testcase_23 | AC | 1,912 ms
233,380 KB |
testcase_24 | AC | 1,964 ms
229,952 KB |
testcase_25 | AC | 1,884 ms
223,812 KB |
testcase_26 | TLE | - |
ソースコード
import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' N = int(input()) nums = [[] for i in range(N)] cou = [0] * N for i in range(N-1): a, b, c = i_map() a -= 1 b -= 1 cou[b] += 2 cou[a] += 2 nums[a].append([b, c]) nums[b].append([a, c]) start = 0 for i in range(N): if cou[i] == 2: start = i break G = [[] for i in range(N)] costs = [INF] * N costs[start] = 0 que = deque() que.append(start) while que: p = que.popleft() for nxt, cost in nums[p]: if costs[nxt] != INF: continue costs[nxt] = cost + costs[p] G[p].append(nxt) que.append(nxt) #print(costs) # Euler Tour の構築 def EuletTour(N, G, start): # 注意!! #G[v]: 頂点Vの子頂点(親頂点は含まない) #start 根。基本は0だが問題によりそれ以外になる。 def dfs(v, d): F[v] = len(S) depth[v] = d S.append(v) for w in G[v]: dfs(w, d+1) S.append(v) S = [] F = [0]*N depth = [0]*N dfs(start, 0) return S, F, depth S, F, depth = EuletTour(N, G, start) # 存在しない範囲は深さが他よりも大きくなるようにする INF = (N, None) # LCAを計算するクエリの前計算 M = 2*N M0 = 2**(M-1).bit_length() data = [INF]*(2*M0) for i, v in enumerate(S): data[M0-1+i] = (depth[v], i) for i in range(M0-2, -1, -1): data[i] = min(data[2*i+1], data[2*i+2]) # LCAの計算 (generatorで最小値を求める) def _query(a, b): yield INF a += M0; b += M0 while a < b: if b & 1: b -= 1 yield data[b-1] if a & 1: yield data[a-1] a += 1 a >>= 1; b >>= 1 # LCAの計算 (外から呼び出す関数) def query(u, v): fu = F[u]; fv = F[v] if fu > fv: fu, fv = fv, fu return S[min(_query(fu, fv+1))[1]] Q = int(input()) for i in range(Q): a, b = i_map() a -= 1 b -= 1 flag = query(a, b) if flag != a and flag != b: c1 = costs[a] - costs[flag] c2 = costs[b] - costs[flag] print(c1 + c2) else: if flag == a: print(costs[b] - costs[a]) else: print(costs[a] - costs[b]) #def main(): #if __name__ == '__main__': # main()