Given two rectangles and the coordinates of two points on the diagonals of each rectangle,you have to calculate the area of the intersected part of two rectangles. its sides are parallel to OX and OY .
Input
Input The first line of input is 8 positive numbers which indicate the coordinates of four points that must be on each diagonal.The 8 numbers are x1,y1,x2,y2,x3,y3,x4,y4.That means the two points on the first rectangle are(x1,y1),(x2,y2);the other two points on the second rectangle are (x3,y3),(x4,y4).
Output
Output For each case output the area of their intersected part in a single line.accurate up to 2 decimal places.
Sample Input
1.00 1.00 3.00 3.00 2.00 2.00 4.00 4.00
5.00 5.00 13.00 13.00 4.00 4.00 12.50 12.50
Sample Output
1.00
56.25
代码:
#include<stdio.h>
#include<string.h>
#include<math.h>
double max(double a, double b)
{
return a>b?a:b;
}
double min(double a, double b)
{
return a<b?a:b;
}
int main()
{
double x1, x2, x3, x4, y1, y2, y3, y4, t;
while(scanf("%lf%lf%lf%lf%lf%lf%lf%lf", &x1, &y1, &x2, &y2, &x3, &y3, &x4, &y4) != EOF)
{
if(x1 > x2)
{
t = x1;
x1 = x2;
x2 = t;
}
if(y1 > y2)
{
t = y1;
y1 = y2;
y2 = t;
}
if(x3 > x4)
{
t = x3;
x3 = x4;
x4 = t;
}
if(y3 > y4)
{
t = y3;
y3 = y4;
y4 = t;
}
x1 = max(x1, x3);
y1 = max(y1, y3);
x2 = min(x2, x4);
y2 = min(y2, y4);
if(x2 < x1 || y2 < y1)
printf("0.00\n");
else
printf("%.2lf\n", (x2 - x1)*(y2 - y1) );
}
return 0;
}
以上代码思路来自博客:https://blog.csdn.net/bmicnj/article/details/51437376
由于给的是坐标那么这里计算长方形的面积公式必然逃不开坐标运算。经几次画图分析知,绝对值这里也用不上。我们暂且可定义此情况下长方形面积公式为:
S = (x2 - x1) * (y2 - y1)
不论是以下3种情况哪种情况,我们会发现都是从x2,x4中选小的,减去x1,x3中选大的。也即面积公式里的x2是矩形顶点x2,x4中小的一个。x1是矩形顶点x1,x3中大的一个。对于y的情况同理。
在做此题时,x1,x2。x3,x4的位置是随意分布的。并不是像上图所示x1总在x2的左边,x3总在x4的左边。
对于这种变来变去的量,我们要把它固定不变,也是为了方便面积公式的使用。我们要自己制定计算规范。即每次都把x1放在x2的左边。x3放在x4的左边。
由于x1,x3总在x2,x4的左边。也就是说max{x1, x3} < min{x2, x4} 恒成立。当把max{x1, x3}赋给x1, min{x2, x4}赋给x2时,若x2 < x1。这是矛盾的,也即两个矩形不会有相交部分。
最后总结:对于这种多变量变动问题,分情况讨论很麻烦,要使用公式问题。可以尝试指定运算规范。来指定在某种情况下使用公式。