提出 #71308142

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    int n; ll h; cin >> n >> h;
    ll low = h, high = h;
    ll time = 0;
    bool f = true;
    rep(i, n){
        ll t, l, u; cin >> t >> l >> u;
        ll ma = high + (t-time), mn = max((ll)0, low-(t-time));
        if(ma < l || mn > u){
            f = false;
        }
        high = min(u, ma);
        low = max(l, mn);
        time = t;
    }
    cout << (f ? "Yes" : "No") << endl;
}

int main(){

    int t; cin >> t;
    while(t--)solve();
    return 0;
}

提出情報

ジャッジ結果