Rectangles
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28587 Accepted Submission(s): 9273
Problem Description
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.005.00 5.00 13.00 13.00 4.00 4.00 12.50 12.50
Sample Output
1.00
56.25
原文网址:http://acm.hdu.edu.cn/showproblem.php?pid=2056
源码:
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
int main()
{
double a[4],b[4];
double c;
while(cin>>a[0]>>b[0]>>a[1]>>b[1]>>a[2]>>b[2]>>a[3]>>b[3])
{
sort(a,a+2); /*保证x2>x1(即a[1]>a[0]),x4>x3(即a[3]>a[2])*/
sort(a+2,a+4);
sort(b,b+2); /*保证y2>y1(即b[1]>b[0]),y4>y3(即b[3]>b[2])*/
sort(b+2,b+4);
if(a[0]<a[3]&&a[1]>a[2]&&b[0]<b[3]&&b[1]>b[2])
{
sort(a,a+4);//始终取这四个数从小到大排的中间两个数,可以将三种情况(左下右上、右上左下、包含)都包含。
sort(b,b+4);
c=(a[2]-a[1])*(b[2]-b[1]);
}
else
c=0.00;
cout<<setprecision(2)<<std::fixed<<c<<endl;
}
return 0;
}
//上面后一个if-else也可改为:
/*if((a[0]>a[3]||b[0]>b[3])||(a[1]<a[2])||(b[1]<b[2]))
{
c=0.00;
}
ele
{
sort(a,a+4);
sort(b,b+4);
c=(a[2]-a[1])*(b[2]-b[1]);
}