Circle Meets Square（几何）

题目链接：https://lpc.ucfprogrammingteam.org/localFiles/local2018Problems.pdf

题意：给你一个圆的圆心坐标，半径，一个正方形左上方顶点，边长，问你这个长方形和园是否相交，相切和相离。

相交输出2相切输出1相离输出0：

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double eps=1e-8;
const double PI= acos(-1.0);
const int M = 1e5+7;
struct node{
	double x,y;
};
node c,t;
double r,s;
double dis(node a,node b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int in_cir(node p)
{
	double d=dis(p,c);
	if(d<r)return 2;
	if(d<=r+eps)return 1;
	return 0;
}
int in_square(node p)
{
	double a=fabs(p.x-(t.x+s/2)),b=fabs(p.y-(t.y+s/2));
	if(a<s/2&&b<s/2)return 2;
	if(a<=s/2+eps&&b<s/2+eps)return 1;
	return 0;
}
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);

  	cin>>c.x>>c.y>>r;
  	cin>>t.x>>t.y>>s;
  	int f=-1;
  	if(in_cir(t)==2||in_cir(node{t.x+s,t.y})==2||in_cir(node{t.x,t.y+s})==2||in_cir(node{t.x+s,t.y+s})==2)
  		f=2;
  	else if(in_square(node{c.x-r,c.y})==2||in_square(node{c.x+r,c.y})==2||in_square(node{c.x,c.y+r})==2||in_square(node{c.x,c.y-r})==2||in_square(c)==2)
	  	f=2;
	else
	{
		int nm1=0,nm2=0;
		if(in_cir(t)==1)nm1++;
		if(in_cir(node{t.x+s,t.y})==1)nm1++;
		if(in_cir(node{t.x,t.y+s})==1)nm1++;
		if(in_cir(node{t.x+s,t.y+s})==1)nm1++;
		if(in_square(node{c.x-r,c.y})==1)
		if(in_square(node{c.x+r,c.y})==1)nm2++;
		if(in_square(node{c.x,c.y+r})==1)nm2++;
		if(in_square(node{c.x,c.y-r})==1)nm2++;
		if(nm1==1||nm2==1)f=1;
		else f=0;
	}
	cout<<f<<endl;
	return 0;
}