蓝桥杯-水域清理

 输入样例

2 3
2
1 1 1 3
1 2 2 2

输出样例

2

代码

import java.util.Scanner;

public class Main06 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();     //行
        int m = scan.nextInt();     //列
        int t = scan.nextInt();     //次数
        int count = 0;
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = -1;     //水域全部赋值为-1
            }
        }
        for (int i = 0; i < t; i++) {
            int r1 = scan.nextInt();
            int c1 = scan.nextInt();
            int r2 = scan.nextInt();
            int c2 = scan.nextInt();
            for (int j = r1 - 1; j <= r2 - 1; j++) {
                for (int k = c1 - 1; k <= c2 - 1; k++) {
                    arr[j][k] = 1;      //如果清理就变为1
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (arr[i][j] == -1) {
                    count++;        //统计未清理面积
                }
            }
        }
        System.out.println(count);
    }
}