Submission #71319162

---

Source Code Expand

import sys
# sys.setrecursionlimit(10 ** 6)

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):
    T = int(src.readline())
    Ns = []
    Hs = []
    TLUs = []
    for _iq in range(T):
        N, H, = map(int, src.readline().split())
        Ns.append(N) ; Hs.append(H)
        TLUs.append([list(map(int, src.readline().split())) for _i in range(N)])

    ans = solve(T, Ns, Hs, TLUs)

    print(*ans, sep="\n", file=dst)

sample = """\
3
2 5
3 1 4
8 9 11
2 6
1 1 4
3 5 8
10 36
27 37 38
30 34 54
38 20 77
45 1 36
49 38 51
52 31 58
65 43 60
71 14 42
73 36 38
85 14 29
"""

def solve(T, Ns, Hs, TLUs):
    ans = []
    for q in range(T):
        N, H, = Ns[q] , Hs[q]
        TLU = TLUs[q]
        pt = 0
        hr = H
        lr = H
        able = True
        for t, l, u in TLU:
            dr = t - pt
            hr += dr
            lr -= dr
            if hr < l or u < lr :
                able = False
                break
            hr = min(hr , u)
            lr = max(lr , l)
            pt = t
            continue
        if able:
            ans.append("Yes")
        else:
            ans.append("No")
    return ans

main()

Submission Info

Judge Result