全TLE求调必关

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	long long ans = 0;
	scanf("%d %d", &n, &m);
	int x1[m], y1[m], x2[m], y2[m];
	memset(x1, 0, sizeof(x1));
	memset(y1, 0, sizeof(y1));
	memset(x2, 0, sizeof(x2));
	memset(y2, 0, sizeof(y2));
	for (int i = 0; i < m; i++) {
		scanf("%d %d %d %d", &x1[i], &y1[i], &x2[i], &y2[i]);
	}
	for (int i = 1; i <= n; i++) {
		int rug;
		for (int j = 1; j <= n; j++) {
			rug = 0;
			for (int k = 1; k <= m; k++) {
				if (i >= x1[k] && i <= x2[k] && j >= y1[k] && j <= y2[k]) {
					rug++;
				}
			}
			ans += ((i + j)^rug);
		}
	}
	printf("%lld", ans);
	return 0;
}