这题主要还是判断相交面积的长宽,能搞清楚里面的逻辑就不难。看看妾身的方法:
#include <iostream>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int sum = 0;
int x1, x2, y1, y2;
for (int i = 0; i < n; i++)
{
cin >> x1 >> y1 >> x2 >> y2;
int x = min(x2, a) - max(0, x1);
int y = min(y2, b) - max(0, y1);
if (x >= 0 && y >= 0)
{
sum += x * y;
}
}
cout << sum << endl;
return 0;
}