提出 #71325129

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int T;

void solve() {
    int N, H;
    cin >> N >> H;
    vector<tuple<int, int, int>> X;
    for (int i = 0; i < N; ++i) {
        int x, l, u;
        cin >> x >> l >> u;
        X.push_back({x, l, u});
    }
    int pre_t = 0, pre_l = H, pre_u = H;
    for (int i = 0; i < N; ++i) {
        auto [t, l, u] = X[i];
        // cout << t << " " << l << " " << u << endl;
        // cout << pre_t << " " << pre_l << " " << pre_u << endl;
        // l について
        int l_ma = pre_l + t - pre_t;
        int l_mi = pre_l - (t - pre_t);
        chmin(l_ma, l);
        chmax(l_mi, u);

        // u について
        int u_ma = pre_u + t - pre_t;
        int u_mi = pre_u - (t - pre_t);
        chmin(u_ma, l);
        chmax(u_mi, u);

        pre_l = min(l_mi, u_mi);
        pre_u = max(l_ma, u_ma);

        // cout << l_ma << " " << l_mi << endl;
        // cout << u_ma << " " << u_mi << endl;

        // cout << pre_l << " " << pre_u << endl;

        if (!(pre_l >= l && pre_l <= u && pre_u >= l && pre_u <= u)) {
            cout << "No" << endl;
            return;
        }

        pre_t = t;
    }

    cout << "Yes" << endl;
}

signed main() {
    cin >> T;
    while (T--) {
        solve();
    }
}

提出情報

ジャッジ結果