Codeforces Round #620 (Div. 2)C.Air Conditioner

C. Air Conditioner
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Gildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.

Gildong tries so hard to satisfy the customers that he even memorized all customers’ preferred temperature ranges! Looking through the reservation list, he wants to satisfy all customers by controlling the temperature of the restaurant.

The restaurant has an air conditioner that has 3 states: off, heating, and cooling. When it’s off, the restaurant’s temperature remains the same. When it’s heating, the temperature increases by 1 in one minute. Lastly, when it’s cooling, the temperature decreases by 1 in one minute. Gildong can change the state as many times as he wants, at any integer minutes. The air conditioner is off initially.

Each customer is characterized by three values: ti — the time (in minutes) when the i-th customer visits the restaurant, li — the lower bound of their preferred temperature range, and hi — the upper bound of their preferred temperature range.

A customer is satisfied if the temperature is within the preferred range at the instant they visit the restaurant. Formally, the i-th customer is satisfied if and only if the temperature is between li and hi (inclusive) in the ti-th minute.

Given the initial temperature, the list of reserved customers’ visit times and their preferred temperature ranges, you’re going to help him find if it’s possible to satisfy all customers.

Input
Each test contains one or more test cases. The first line contains the number of test cases q (1≤q≤500). Description of the test cases follows.

The first line of each test case contains two integers n and m (1≤n≤100, −109≤m≤109), where n is the number of reserved customers and m is the initial temperature of the restaurant.

Next, n lines follow. The i-th line of them contains three integers ti, li, and hi (1≤ti≤109, −109≤li≤hi≤109), where ti is the time when the i-th customer visits, li is the lower bound of their preferred temperature range, and hi is the upper bound of their preferred temperature range. The preferred temperature ranges are inclusive.

The customers are given in non-decreasing order of their visit time, and the current time is 0.

Output
For each test case, print “YES” if it is possible to satisfy all customers. Otherwise, print “NO”.

You can print each letter in any case (upper or lower).

Example

inputCopy
4
3 0
5 1 2
7 3 5
10 -1 0
2 12
5 7 10
10 16 20
3 -100
100 0 0
100 -50 50
200 100 100
1 100
99 -100 0
outputCopy
YES
NO
YES
NO
Note
In the first case, Gildong can control the air conditioner to satisfy all customers in the following way:

At 0-th minute, change the state to heating (the temperature is 0).
At 2-nd minute, change the state to off (the temperature is 2).
At 5-th minute, change the state to heating (the temperature is 2, the 1-st customer is satisfied).
At 6-th minute, change the state to off (the temperature is 3).
At 7-th minute, change the state to cooling (the temperature is 3, the 2-nd customer is satisfied).
At 10-th minute, the temperature will be 0, which satisfies the last customer.
In the third case, Gildong can change the state to heating at 0-th minute and leave it be. Then all customers will be satisfied. Note that the 1-st customer’s visit time equals the 2-nd customer’s visit time.

In the second and the fourth case, Gildong has to make at least one customer unsatisfied.

题意：有n个顾客，0分钟的时候温度是m，每个顾客在第t时候到，他适应的温度为l到r
问是不是能让所有顾客都在适应温度内

思路：我们去维护一个温度的能达到的区间
然后去计算l=max(l,a[i].l),r=min(r,a[i].r) 如果有l>r 就是NO

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define me(a,x) memset(a,x,sizeof a)
#define pb(a) push_back(a)
#define paii pair<int,int>
#define pali pair<ll,int>
#define pail pair<int,ll>
#define pall pair<ll,ll>
#define fi first
#define se second
struct node
{
    ll t,l,r;
}a[105];
int main()
{

   int t;cin>>t;
   while(t--){

      int n,m;
      cin>>n>>m;
      for(int i=1;i<=n;i++) cin>>a[i].t>>a[i].l>>a[i].r;

      int flag=0;
      ll l=m,r=m,q=0;
      for(int i=1;i<=n;i++){
        r=r+(a[i].t-q);
        l=l-(a[i].t-q);
        q=a[i].t;
        if( (r=min(r,a[i].r))  < (l=max(l,a[i].l))) {flag=1;break;}
      }
        puts(flag?"NO":"YES");

   }
    return 0;

}