結果
問題 | No.1637 Easy Tree Query |
ユーザー | ansain |
提出日時 | 2021-08-06 21:44:07 |
言語 | Python3 (3.11.6 + numpy 1.26.0 + scipy 1.11.3) |
結果 |
AC
|
実行時間 | 549 ms / 2,000 ms |
コード長 | 2,117 bytes |
コンパイル時間 | 614 ms |
コンパイル使用メモリ | 11,784 KB |
実行使用メモリ | 41,480 KB |
最終ジャッジ日時 | 2023-10-17 05:04:58 |
合計ジャッジ時間 | 12,603 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
10,216 KB |
testcase_01 | AC | 28 ms
10,216 KB |
testcase_02 | AC | 450 ms
38,320 KB |
testcase_03 | AC | 28 ms
10,216 KB |
testcase_04 | AC | 217 ms
24,740 KB |
testcase_05 | AC | 293 ms
20,484 KB |
testcase_06 | AC | 202 ms
17,796 KB |
testcase_07 | AC | 96 ms
10,852 KB |
testcase_08 | AC | 158 ms
21,584 KB |
testcase_09 | AC | 350 ms
31,508 KB |
testcase_10 | AC | 153 ms
16,356 KB |
testcase_11 | AC | 440 ms
33,728 KB |
testcase_12 | AC | 397 ms
28,428 KB |
testcase_13 | AC | 105 ms
16,540 KB |
testcase_14 | AC | 307 ms
32,040 KB |
testcase_15 | AC | 421 ms
34,872 KB |
testcase_16 | AC | 409 ms
37,492 KB |
testcase_17 | AC | 133 ms
16,520 KB |
testcase_18 | AC | 278 ms
20,472 KB |
testcase_19 | AC | 311 ms
22,516 KB |
testcase_20 | AC | 390 ms
27,644 KB |
testcase_21 | AC | 260 ms
24,992 KB |
testcase_22 | AC | 495 ms
38,096 KB |
testcase_23 | AC | 140 ms
17,976 KB |
testcase_24 | AC | 250 ms
25,004 KB |
testcase_25 | AC | 290 ms
19,720 KB |
testcase_26 | AC | 413 ms
29,440 KB |
testcase_27 | AC | 549 ms
36,888 KB |
testcase_28 | AC | 235 ms
19,056 KB |
testcase_29 | AC | 360 ms
27,024 KB |
testcase_30 | AC | 239 ms
26,812 KB |
testcase_31 | AC | 174 ms
10,348 KB |
testcase_32 | AC | 196 ms
20,156 KB |
testcase_33 | AC | 254 ms
16,520 KB |
testcase_34 | AC | 288 ms
41,480 KB |
ソースコード
import sys from collections import defaultdict, Counter, deque from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate import operator from math import sqrt, gcd, factorial #from math import isqrt, prod, comb #python3.8用(notpypy) #from bisect import bisect_left, bisect_right #from functools import lru_cache, reduce #from heapq import heappush, heappop, heapify, heappushpop, heapreplace #import numpy as np #import networkx as nx #from networkx.utils import UnionFind #from numba import njit, b1, i1, i4, i8, f8 #numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1 #from scipy.sparse import csr_matrix #from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree def input(): return sys.stdin.readline().rstrip() def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no) def main(): """ グラフが隣接辺で与えられる場合 """ mod = 10**9+7 mod2 = 998244353 n,q=map(int, input().split()) graph = [[] for _ in range(n)] for i in range(n-1): a, b = map(lambda x: int(x)-1, input().split()) graph[a].append(b) graph[b].append(a) mother = [[] for _ in range(n)] dp = [1]*n # print(dp) visited = [False]*n visited[0] = True d = deque() d.append(0) def merge(a, b): return (a+b) while d: v = d[-1] if graph[v] == []: # 帰りがけ for m in mother[v]: dp[v] = merge(dp[v], dp[m]) d.pop() else: # 行きがけ i = graph[v].pop() if visited[i]: continue visited[i] = True d.append(i) mother[v].append(i) ans=0 for i in range(q): p,x=map(int, input().split()) p-=1 ans+=dp[p]*x print(ans) if __name__ == '__main__': main()