結果
問題 | No.2325 Skill Tree |
ユーザー | cozy_sauna |
提出日時 | 2023-05-28 13:52:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 717 ms / 3,000 ms |
コード長 | 2,729 bytes |
コンパイル時間 | 512 ms |
コンパイル使用メモリ | 87,268 KB |
実行使用メモリ | 133,340 KB |
最終ジャッジ日時 | 2023-08-27 08:35:08 |
合計ジャッジ時間 | 26,190 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 258 ms
91,804 KB |
testcase_01 | AC | 259 ms
91,880 KB |
testcase_02 | AC | 259 ms
92,192 KB |
testcase_03 | AC | 259 ms
91,996 KB |
testcase_04 | AC | 255 ms
92,160 KB |
testcase_05 | AC | 256 ms
91,660 KB |
testcase_06 | AC | 258 ms
92,152 KB |
testcase_07 | AC | 409 ms
100,772 KB |
testcase_08 | AC | 420 ms
106,452 KB |
testcase_09 | AC | 422 ms
103,576 KB |
testcase_10 | AC | 454 ms
112,820 KB |
testcase_11 | AC | 455 ms
108,320 KB |
testcase_12 | AC | 596 ms
120,840 KB |
testcase_13 | AC | 590 ms
120,200 KB |
testcase_14 | AC | 595 ms
120,740 KB |
testcase_15 | AC | 606 ms
121,212 KB |
testcase_16 | AC | 582 ms
120,500 KB |
testcase_17 | AC | 566 ms
119,460 KB |
testcase_18 | AC | 570 ms
119,156 KB |
testcase_19 | AC | 562 ms
119,360 KB |
testcase_20 | AC | 563 ms
119,124 KB |
testcase_21 | AC | 558 ms
119,268 KB |
testcase_22 | AC | 604 ms
122,472 KB |
testcase_23 | AC | 607 ms
122,896 KB |
testcase_24 | AC | 601 ms
122,572 KB |
testcase_25 | AC | 591 ms
119,956 KB |
testcase_26 | AC | 609 ms
122,360 KB |
testcase_27 | AC | 715 ms
132,176 KB |
testcase_28 | AC | 705 ms
132,336 KB |
testcase_29 | AC | 707 ms
131,956 KB |
testcase_30 | AC | 703 ms
132,524 KB |
testcase_31 | AC | 717 ms
132,564 KB |
testcase_32 | AC | 660 ms
131,456 KB |
testcase_33 | AC | 659 ms
132,028 KB |
testcase_34 | AC | 663 ms
132,288 KB |
testcase_35 | AC | 708 ms
132,224 KB |
testcase_36 | AC | 690 ms
131,660 KB |
testcase_37 | AC | 707 ms
133,340 KB |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque, Counter from itertools import permutations, combinations, product from functools import lru_cache from bisect import bisect_left, bisect_right from heapq import heappush, heappop from copy import copy, deepcopy from decimal import Decimal from random import random, randrange # from pypyjit import set_param # set_param('max_unroll_recursion=-1') setrecursionlimit(1 << 20) readline = stdin.readline INF = 10 ** 18 MOD = 998244353 # MOD = 1000000007 ALP = 26 ''' Input ''' def I(): return int(readline()) def ST(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def LII(): return list(map(lambda x: int(x) - 1, readline().split())) def LF(x, func): return [func() for _ in [0] * x] def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x) - 1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] ''' Array ''' def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x ''' Alphabet ''' def alp_a_to_i(s): return ord(s) - ord('a') def alp_A_to_i(s): return ord(s) - ord('A') def alp_i_to_a(i): return chr(ord('a') + i) def alp_i_to_A(i): return chr(ord('A') + i) ''' Other''' def nynx(y, x, H, W): return [(y + dy, x + dx) for dy, dx in [(-1, 0), (1, 0), (0, -1), (0, 1)] if 0 <= y + dy < H and 0 <= x + dx < W] def gen(x, *args): if len(args) == 1: return [x] * args[0] if len(args) == 2: return [[x] * args[1] for _ in [0] * args[0]] if len(args) == 3: return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]] if len(args) == 4: return [[[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]] for _ in [0] * args[0]] ''' Output ''' def pprint(E): print() for e in E: print(e) def Yes(): print("Yes") def No(): print("No") def YES(): print("YES") def NO(): print("NO") def yn(x): print("Yes" if x else "No") def YN(x): print("YES" if x else "NO") ############################################################################################### N = I() node = [[] for _ in range(N)] LA = [] for i in range(N - 1): i += 1 l, a = SPI() a -= 1 node[a].append((i, l)) COST = [] dist = gen(INF, N) que = deque([(0, 0)]) while que: v, c = que.popleft() if dist[v] != INF: continue COST.append(c) dist[v] = c for nx, nx_c in node[v]: que.appendleft((nx, max(c, nx_c))) COST.sort() # print(COST) Q = I() for _ in range(Q): c, *A = SPI() if c == 1: x = A[0] ans = bisect_right(COST, x) print(ans) if c == 2: y = A[0] - 1 ans = dist[y] if ans == INF: ans = -1 print(ans)