cf1304 C. Air Conditioner

题意：

给定n个区间和一个起始点温度m，然后从0分钟开始，温度每一分钟可以+1，-1，+0，
接下来有n个三元组，s，l，r，表示目前s分钟，要求温度范围在l,r，问是否能满足在每个区间温度都满足

思路：

我们只需要维护一个最大温度ma，最小温度mi就ok了。然后每次只要当前区间mi > r || ma < l就不满足，
细节看代码吧。

code

#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
const int man = 1e2+10;
#define IOS ios::sync_with_stdio(0)
template <typename T>
inline T read(){T sum=0,fl=1;int ch=getchar();
for(;!isdigit(ch);ch=getchar())if(ch=='-')fl=-1;
for(;isdigit(ch);ch=getchar())sum=sum*10+ch-'0';
return sum*fl;}
template <typename T>
inline void write(T x) {static int sta[35];int top=0;
do{sta[top++]= x % 10, x /= 10;}while(x);
while (top) putchar(sta[--top] + 48);}
template<typename T>T gcd(T a, T b) {return b==0?a:gcd(b, a%b);}
template<typename T>T exgcd(T a,T b,T &g,T &x,T &y){if(!b){g = a,x = 1,y = 0;}
else {exgcd(b,a%b,g,y,x);y -= x*(a/b);}}
#ifndef ONLINE_JUDGE
#define debug(fmt, ...) {printf("debug ");printf(fmt,##__VA_ARGS__);puts("");}
#else
#define debug(fmt, ...)
#endif
typedef long long ll;
const ll mod = 1e9+7;
struct node{
    int l,r,s;
    //node(int l = 0,int r = 0,int s = 0):l(l),r(r),s(s){}
}sp[man];

int main() {
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        //freopen("out.txt","w",stdout);
    #endif
    int t;
    cin >> t;
    while(t--){
        int n,s;
        cin >> n >> s;
        int mi = s,ma = s;
        for(int i = 1;i <= n;i++){
            cin >> sp[i].s >> sp[i].l >> sp[i].r;
        }
        int pres = 0;
        bool f = 0;
        for(int i = 0;i < n;i++){
            int l = sp[i+1].l;
            int r = sp[i+1].r;
            int tps = sp[i+1].s;
            if(l < mi)mi -= (tps - pres),mi = max(l,mi);//可以往更小的方向，但不能越界
            else if(l > mi)mi += (tps - pres),mi = min(l,mi);//必须增大。
            if(r > ma)ma += (tps - pres),ma = min(r,ma);//同理
            else if(r < ma)ma -= (tps - pres),ma = max(r,ma);
            if(mi > r || ma < l){//判断是否满足
                f = 1;
                break;
            }
            ma = min(ma,r);//缩小范围
            mi = max(l,mi);
            //cout << mi << " " << ma << endl;
            pres = tps;
        }
        if(f)cout << "NO\n";
        else cout << "YES\n";
    }   
    return 0;
}
/*
3
3 0
100 -100 100
150 0 0
150 0 0
*/