CodeForces 281c Rectangle Puzzle 计算几何

最新推荐文章于 2020-09-24 12:30:43 发布

alpc_paul

最新推荐文章于 2020-09-24 12:30:43 发布

阅读量602

点赞数

分类专栏：计算几何

本文链接：https://blog.csdn.net/alpc_paul/article/details/38501459

版权

计算几何专栏收录该内容

4 篇文章 0 订阅

订阅专栏

You are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle's sides are parallel to the coordinate axes: the length of the side that is parallel to the Ox axis, equals w, the length of the side that is parallel to the Oy axis, equals h. The second rectangle can be obtained by rotating the first rectangle relative to the origin of coordinates by angle α.

$\text{[math]}$

Your task is to find the area of the region which belongs to both given rectangles. This region is shaded in the picture.

Input

The first line contains three integers w, h, α (1 ≤ w, h ≤ 106; 0 ≤ α ≤ 180). Angle α is given in degrees.

Output

In a single line print a real number — the area of the region which belongs to both given rectangles.

The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.

   Sample test(s) 
 
     input 
   
1 1 45

     output 
   
0.828427125

     input 
   
6 4 30

     output 
   
19.668384925

计算几何，分两种情况考虑

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int main ()
{
	int x,y,z;
	double a,b,arf;
	//freopen("date.in","r",stdin);
	scanf("%d%d%d",&x,&y,&z);
	a=x;
	b=y;
	arf=z;
	
	double temp=max(a,b);
	b=min(a,b);
	a=temp;
	if(z==90) {printf("%f\n",b*b);return 0;}
	else if(z==180||z==0){
		printf("%f\n",a*b);
		return 0;
	}
	else {
		
		if(z>90)
		{
			arf=180.0-arf;
		}
		
		double tem=2*atan(b/a);
		double pi=acos(-1);
		arf=(arf*pi)/180.0;
		double g=tan(arf);
		double k=1.0/cos(arf);
		if(arf<tem)
		{
			double s1=(((1+k)*a-g*b)/((1+k)*(1+k)-g*g))*(((1+k)*a-g*b)/((1+k)*(1+k)-g*g))*g;
			double s2=(((1+k)*b-g*a)/((1+k)*(1+k)-g*g))*(((1+k)*b-g*a)/((1+k)*(1+k)-g*g))*g;
			double s=a*b;
			double ans=(s-s1-s2);
			printf("%.9f\n",ans);
		}
		else 
		{
			
			double ans=b*b/sin(arf);
			printf("%.9f\n",ans);
		}
	}
	return 0;
}