提出 #71310280

---

ソースコード 拡げる

def solve():
    N, H = map(int, input().split())
    targets = [list(map(int, input().split())) for _ in range(N)]

    h_range = [H, H]
    t_now = 0

    for time, low, up in targets:
        tdiff = time - t_now
        bottom = max(0, h_range[0] - tdiff)
        top = h_range[1] + tdiff
        if (bottom > up) or (top < low):
            print("No")
            return
        nbottom = max(low, bottom)
        ntop = min(up, top)
        t_now = time
        h_range = [nbottom, ntop]
    
    print('Yes')

def main():
    T = int(input())
    for _ in range(T):
        solve()

main()

提出情報

ジャッジ結果