結果

問題 No.2885 Range Triangle Collision Decision Queries
ユーザー Iroha_3856Iroha_3856
提出日時 2024-08-30 00:36:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,645 ms / 3,000 ms
コード長 4,463 bytes
コンパイル時間 337 ms
コンパイル使用メモリ 82,436 KB
実行使用メモリ 128,020 KB
最終ジャッジ日時 2024-09-07 19:42:30
合計ジャッジ時間 77,560 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 591 ms
86,868 KB
testcase_01 AC 634 ms
87,408 KB
testcase_02 AC 578 ms
87,776 KB
testcase_03 AC 578 ms
87,240 KB
testcase_04 AC 593 ms
87,384 KB
testcase_05 AC 1,323 ms
126,604 KB
testcase_06 AC 1,416 ms
128,020 KB
testcase_07 AC 1,443 ms
127,148 KB
testcase_08 AC 1,426 ms
127,408 KB
testcase_09 AC 1,410 ms
126,864 KB
testcase_10 AC 1,545 ms
126,140 KB
testcase_11 AC 1,548 ms
126,412 KB
testcase_12 AC 1,463 ms
126,328 KB
testcase_13 AC 1,498 ms
126,500 KB
testcase_14 AC 1,455 ms
126,104 KB
testcase_15 AC 1,444 ms
126,068 KB
testcase_16 AC 1,498 ms
126,820 KB
testcase_17 AC 753 ms
124,864 KB
testcase_18 AC 1,368 ms
126,444 KB
testcase_19 AC 1,416 ms
126,780 KB
testcase_20 AC 1,378 ms
125,456 KB
testcase_21 AC 1,376 ms
126,056 KB
testcase_22 AC 1,167 ms
126,652 KB
testcase_23 AC 1,438 ms
126,824 KB
testcase_24 AC 1,483 ms
126,012 KB
testcase_25 AC 1,259 ms
126,136 KB
testcase_26 AC 1,471 ms
126,604 KB
testcase_27 AC 1,502 ms
126,204 KB
testcase_28 AC 1,600 ms
126,512 KB
testcase_29 AC 1,438 ms
126,444 KB
testcase_30 AC 1,523 ms
125,796 KB
testcase_31 AC 1,506 ms
126,640 KB
testcase_32 AC 1,475 ms
126,548 KB
testcase_33 AC 1,442 ms
126,976 KB
testcase_34 AC 1,523 ms
125,804 KB
testcase_35 AC 1,436 ms
126,616 KB
testcase_36 AC 1,461 ms
126,668 KB
testcase_37 AC 1,531 ms
126,704 KB
testcase_38 AC 1,645 ms
126,764 KB
testcase_39 AC 1,484 ms
126,632 KB
testcase_40 AC 1,344 ms
126,156 KB
testcase_41 AC 1,353 ms
125,800 KB
testcase_42 AC 1,292 ms
125,332 KB
testcase_43 AC 1,512 ms
126,348 KB
testcase_44 AC 1,441 ms
125,940 KB
testcase_45 AC 1,517 ms
126,644 KB
testcase_46 AC 1,423 ms
126,812 KB
testcase_47 AC 1,347 ms
126,484 KB
testcase_48 AC 1,386 ms
126,032 KB
testcase_49 AC 314 ms
85,308 KB
testcase_50 AC 403 ms
86,268 KB
testcase_51 AC 431 ms
87,036 KB
testcase_52 AC 446 ms
86,932 KB
testcase_53 AC 61 ms
69,552 KB
testcase_54 AC 60 ms
69,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ACL-Python/SegTree
import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1
    return x

def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2
    return x

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)

        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])
#ACL-Python/SegTree 終わり

def convert(a, b, d, k):
	if k == 0:
	 #__が分離直線, |が分離軸
	    return b-d, b;
	elif k == 1:
		#／が分離直線、＼が分離軸
		return a-b, a-b+2*d
	else:
		#＼が分離直線、／が分離軸
		return a+b-2*d, a+b

N = int(input())
A, B, D = [0]*N, [0]*N, [0]*N
for i in range(N):
	A[i], B[i], D[i] = map(int, input().split())

Q = int(input())
S, L, R = [0]*Q, [0]*Q, [0]*Q
for i in range(Q):
	S[i], L[i], R[i] = map(int, input().split())

ans = [True] * Q

for k in range(3):
	p, q = [0]*N, [0]*N
	for i in range(N):
		p[i], q[i] = convert(A[i], B[i], D[i], k)
	INF = 8*10**18
	pseg, qseg = SegTree(max, -INF, p), SegTree(min, INF, q)
	for i in range(Q):
		resp, resq = pseg.prod(L[i]-1, R[i]), qseg.prod(L[i]-1, R[i])
		sp, sq = p[S[i]-1], q[S[i]-1]
		if resp < sq and resq > sp:
			None
		else:
			ans[i] = False

for i in range(Q):
	if ans[i]:
		print("Yes")
	else:
		print("No")
0