Submission #71330027

---

Source Code Expand

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(System.out);

        int T = sc.nextInt();
        while (T-- > 0) {
            int N = sc.nextInt();
            long H = sc.nextLong();

            long currentMin = H;
            long currentMax = H;
            long prevT = 0;
            boolean possible = true;

            for (int i = 0; i < N; i++) {
                long t = sc.nextLong();
                long l = sc.nextLong();
                long u = sc.nextLong();

                if (!possible) continue;

                long dt = t - prevT;
                long reachLow = currentMin - dt;
                long reachHigh = currentMax + dt;

                currentMin = Math.max(reachLow, l);
                currentMax = Math.min(reachHigh, u);

                if (currentMin > currentMax) {
                    possible = false;
                }

                prevT = t;
            }

            out.println(possible ? "Yes" : "No");
        }
        out.flush();
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}

Submission Info

Judge Result