結果
問題 | No.1637 Easy Tree Query |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 21:08:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 720 ms / 2,000 ms |
コード長 | 1,966 bytes |
コンパイル時間 | 604 ms |
コンパイル使用メモリ | 87,352 KB |
実行使用メモリ | 197,696 KB |
最終ジャッジ日時 | 2023-09-17 08:23:53 |
合計ジャッジ時間 | 25,693 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 250 ms
91,680 KB |
testcase_01 | AC | 248 ms
91,620 KB |
testcase_02 | AC | 637 ms
106,284 KB |
testcase_03 | AC | 253 ms
91,808 KB |
testcase_04 | AC | 416 ms
100,544 KB |
testcase_05 | AC | 598 ms
99,992 KB |
testcase_06 | AC | 495 ms
97,812 KB |
testcase_07 | AC | 403 ms
94,640 KB |
testcase_08 | AC | 388 ms
99,032 KB |
testcase_09 | AC | 563 ms
103,820 KB |
testcase_10 | AC | 462 ms
97,648 KB |
testcase_11 | AC | 647 ms
105,084 KB |
testcase_12 | AC | 656 ms
102,844 KB |
testcase_13 | AC | 373 ms
97,452 KB |
testcase_14 | AC | 495 ms
104,128 KB |
testcase_15 | AC | 648 ms
105,280 KB |
testcase_16 | AC | 586 ms
106,152 KB |
testcase_17 | AC | 408 ms
97,600 KB |
testcase_18 | AC | 578 ms
99,860 KB |
testcase_19 | AC | 569 ms
99,992 KB |
testcase_20 | AC | 645 ms
102,256 KB |
testcase_21 | AC | 497 ms
101,720 KB |
testcase_22 | AC | 715 ms
106,524 KB |
testcase_23 | AC | 418 ms
97,588 KB |
testcase_24 | AC | 478 ms
101,576 KB |
testcase_25 | AC | 588 ms
98,192 KB |
testcase_26 | AC | 667 ms
103,820 KB |
testcase_27 | AC | 720 ms
106,104 KB |
testcase_28 | AC | 532 ms
97,988 KB |
testcase_29 | AC | 592 ms
101,884 KB |
testcase_30 | AC | 423 ms
101,660 KB |
testcase_31 | AC | 496 ms
94,772 KB |
testcase_32 | AC | 465 ms
98,088 KB |
testcase_33 | AC | 575 ms
97,648 KB |
testcase_34 | AC | 579 ms
197,696 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 ###関数コピーしたか?### def main(): n, q = i_map() nums = [[] for i in range(n)] for i in range(n-1): a, b = i_map() a -= 1 b -= 1 nums[a].append(b) nums[b].append(a) def dfs(s, p, juge): juge[s] = True cou = 1 for i in nums[s]: if i == p: continue if juge[i] == False: cou += dfs(i, s, juge) count[s] = cou return cou count = [0] * n juge = [False] * n dfs(0, -1, juge) ans = 0 for i in range(q): point, cost = i_map() point -= 1 ans += count[point] * cost print(ans) if __name__ == '__main__': main()