Submission #71315528

---

Source Code Expand

#include <bits/stdc++.h>
#define nn '\n'
typedef long long ll;
using namespace std;

void solve1() {
    int w, b;
    cin >> w >> b;
    cout << 1000*w/b + 1;
}

void solve2() {
    int m,n;
    cin >> n >> m;
    map<int, pair<int, int>> data;
    for (int i=0; i<n; ++i) {
        int el1, el2; 
        cin >> el1 >> el2;
        data[el1].first += el2;
        data[el1].second++;
    }
    cout << fixed << setprecision(10);
    for (auto& [s, m]: data) {
        cout << (double) m.first / m.second << nn;
    }
}

void solve() {
    int T;
    cin >> T;
    while (T--) {
        int N, H;
        cin >> N >> H;
        vector<int> t(N), l(N), u(N);
        for (int i = 0; i < N; i++) {
            cin >> t[i] >> l[i] >> u[i];
        }
        int prev_t = 0;
        int low = H, high = H;
        bool possible = true;
        for (int i = 0; i < N; i++) {
            int dt = t[i] - prev_t;
            low = max(1, low - dt);
            high = high + dt;
            low = max(low, l[i]);
            high = min(high, u[i]);     
            if (low > high) {
                possible = false;
                break;
            }
            prev_t = t[i];
        }
        cout << (possible ? "Yes" : "No") << "\n";
    }
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Submission Info

Judge Result