CSP 202303-1 田地丈量

黎 浩然/ 15 8 月, 2023/ 算法/ALGORITHMS/ 0 comments

Java：100/100

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int n, x, y;
        Scanner scanner = new Scanner(System.in);

        n = scanner.nextInt();
        x = scanner.nextInt();
        y = scanner.nextInt();

        int [] x1= new int[n];
        int [] y1= new int[n];
        int [] x2= new int[n];
        int [] y2= new int[n];
        for (int i = 0; i < n; i++) {
            x1[i] = scanner.nextInt();
            y1[i] = scanner.nextInt();
            x2[i] = scanner.nextInt();
            y2[i] = scanner.nextInt();
        }

        int area = 0;
        int width, height;
        for (int i = 0; i < n; i++) {
            if (y1[i] >= y
            ||  y2[i] <= 0
            ||  x1[i] >= x
            ||  x2[i] <= 0) {
                continue;
            }

            width = Math.min(x2[i], x) - Math.max(x1[i], 0);
            height = Math.min(y2[i], y) - Math.max(y1[i], 0);
            area += width * height;
        }
        System.out.println(area);
    }
}