样例输入
4 10 10
0 0 5 5
5 -2 15 3
8 8 15 15
-2 10 3 15
样例输出
44
分析:
先排除完全不在区域内的田地,然后剩下的重叠,就重叠部分的和。右上角的坐标和(a,b)求最小,左下角和(0,0)求最大,然后求重叠面积,求和。
代码:100
#include<iostream>
using namespace std;
int min(int x, int y)
{
if (x > y)
return y;
return x;
}
int max(int x, int y)
{
if (x > y)
return x;
return y;
}
int main()
{
int n = 0, a = 0, b = 0;
cin >> n >> a >> b;
int i = 0, j = 0;
int x1 = 0, y1 = 0, x2 = 0, y2 = 0;
int sum = 0;
for (i = 0; i < n; i++)
{
cin >> x1 >> y1 >> x2 >> y2;
if (x1 >= a || y1 >= b || x2 <= 0 || y2 <= 0)
continue;
sum += (min(x2, a) - max(x1, 0)) * (min(y2, b) - max(y1, 0));
}
cout << sum << endl;
}