Submission #71307985

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
int t, n, h;
struct node {
	int tmm, l, r;
	bool operator <(node a) {
		return tmm < a.tmm;
	}
} a[100005];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> t;
	while(t --) {
		cin >> n >> h;
		for(int i = 1; i <= n; i ++) cin >> a[i].tmm >> a[i].l >> a[i].r;
		sort(a + 1, a + 1 + n);
		int l = h, r = h, f = 1;
		for(int i = 1; i <= n; i ++) {
			l -= a[i].tmm - a[i - 1].tmm;
			r += a[i].tmm - a[i - 1].tmm;
			l = max(l, a[i].l);
			r = min(r, a[i].r);
			if(r < l) {
				f = 0;
				break;
			}
		}
		if(f) cout << "Yes\n";
		else cout << "No\n";
	}
	return 0;
}

Submission Info

Judge Result