結果
| 問題 | No.2325 Skill Tree |
| ユーザー |
 とりゐ
|
| 提出日時 | 2023-05-28 13:52:21 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 692 ms / 3,000 ms |
| コード長 | 4,746 bytes |
| コンパイル時間 | 253 ms |
| コンパイル使用メモリ | 81,664 KB |
| 実行使用メモリ | 117,060 KB |
| 最終ジャッジ日時 | 2024-12-26 22:08:34 |
| 合計ジャッジ時間 | 19,639 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 75 ms
67,200 KB |
| testcase_01 | AC | 74 ms
67,456 KB |
| testcase_02 | AC | 74 ms
67,328 KB |
| testcase_03 | AC | 69 ms
67,072 KB |
| testcase_04 | AC | 73 ms
67,072 KB |
| testcase_05 | AC | 70 ms
67,072 KB |
| testcase_06 | AC | 74 ms
67,328 KB |
| testcase_07 | AC | 207 ms
82,432 KB |
| testcase_08 | AC | 245 ms
91,736 KB |
| testcase_09 | AC | 253 ms
86,912 KB |
| testcase_10 | AC | 304 ms
100,296 KB |
| testcase_11 | AC | 278 ms
93,192 KB |
| testcase_12 | AC | 465 ms
114,468 KB |
| testcase_13 | AC | 501 ms
114,464 KB |
| testcase_14 | AC | 471 ms
114,724 KB |
| testcase_15 | AC | 545 ms
113,676 KB |
| testcase_16 | AC | 487 ms
114,340 KB |
| testcase_17 | AC | 420 ms
114,604 KB |
| testcase_18 | AC | 434 ms
114,840 KB |
| testcase_19 | AC | 433 ms
114,336 KB |
| testcase_20 | AC | 443 ms
113,484 KB |
| testcase_21 | AC | 472 ms
114,588 KB |
| testcase_22 | AC | 554 ms
116,664 KB |
| testcase_23 | AC | 516 ms
116,800 KB |
| testcase_24 | AC | 477 ms
117,060 KB |
| testcase_25 | AC | 513 ms
116,764 KB |
| testcase_26 | AC | 501 ms
116,760 KB |
| testcase_27 | AC | 629 ms
111,908 KB |
| testcase_28 | AC | 610 ms
109,528 KB |
| testcase_29 | AC | 623 ms
111,452 KB |
| testcase_30 | AC | 621 ms
112,456 KB |
| testcase_31 | AC | 692 ms
108,888 KB |
| testcase_32 | AC | 531 ms
114,160 KB |
| testcase_33 | AC | 561 ms
108,840 KB |
| testcase_34 | AC | 559 ms
109,704 KB |
| testcase_35 | AC | 616 ms
111,856 KB |
| testcase_36 | AC | 630 ms
116,364 KB |
| testcase_37 | AC | 609 ms
113,200 KB |
ソースコード
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a=None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = self.size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _find_bucket(self, x: T) -> List[T]:
"Find the bucket which should contain x. self must not be empty."
for a in self.a:
if x <= a[-1]: return a
return a
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a = self._find_bucket(x)
insort(a, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, x)
if i == len(a) or a[i] != x: return False
a.pop(i)
self.size -= 1
if len(a) == 0: self._build()
return True
def lt(self, x: T) -> Union[T, None]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Union[T, None]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Union[T, None]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Union[T, None]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, x: int) -> T:
"Return the x-th element, or IndexError if it doesn't exist."
if x < 0: x += self.size
if x < 0: raise IndexError
for a in self.a:
if x < len(a): return a[x]
x -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
from sys import stdin
input=lambda :stdin.readline()[:-1]
n=int(input())
chi=[[] for i in range(n)]
s=set()
lev=[0]*n
for i in range(1,n):
l,a=map(int,input().split())
chi[a-1].append(i)
lev[i]=l
todo=[0]
seen=[0]*n
while todo:
v=todo.pop()
seen[v]=1
for u in chi[v]:
todo.append(u)
lev[u]=max(lev[u],lev[v])
for i in range(n):
if seen[i]==0:
lev[i]=10**18
S=SortedMultiset()
for i in lev:
S.add(i)
q=int(input())
for _ in range(q):
t,x=map(int,input().split())
if t==1:
print(S.index_right(x))
else:
if seen[x-1]==0:
print(-1)
else:
print(lev[x-1])