2746872_ac_0ms_72k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int max(int x, int y)
{
	if(x > y) 
		return x;
	else 
		return y; 
}

int min(int x, int y)
{
    if(x < y) 
		return x;
	else 
		return y; 
}

int multi(int p1x,int p1y,int p2x,int p2y,int p0x,int p0y)
{
    return (p1x-p0x)*(p2y-p0y)-(p2x-p0x)*(p1y-p0y);
}

 

int isIntersected(int s1x,int s1y,int e1x,int e1y,int s2x,int s2y,int e2x,int e2y)
{
    if((max(s1x, e1x) >= min(s2x, e2x)) &&

              (max(s2x, e2x) >= min(s1x, e1x)) &&

              (max(s1y, e1y) >= min(s2y, e2y)) &&

              (max(s2y, e2y) >= min(s1y, e1y)) &&

              (multi(s2x,s2y,e1x,e1y,s1x,s1y) * multi(e1x,e1y,e2x,e2y,s1x,s1y) >= 0) &&

              (multi(s1x,s1y,e2x,e2y,s2x,s2y) * multi(e2x,e2y,e1x,e1y,s2x,s2y) >= 0)

              )  return 1;
    return 0;
}

int main()
{
	int t, tt;
	int xs, ys, xe, ye, xl, yt, xr, yb;

	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d%d%d%d%d%d",&xs,&ys,&xe,&ye,&xl,&yt,&xr,&yb);
		if(xl>xr)
		{
			tt = xl;
			xl = xr;
			xr = tt;
		}
		if(yt<yb)
		{
			tt = yt;
			yt = yb;
			yb = tt;
		}
		if(xs<=xr&&xs>=xl&&ys<=yt&&ys>=yb)
		{
			printf("T\n");
			continue;
		}
		if(xe<=xr&&xe>=xl&&ye<=yt&&ye>=yb)
		{
			printf("T\n");
			continue;
		}
		if(isIntersected(xs,ys,xe,ye,xl,yb,xl,yt)
			||isIntersected(xs,ys,xe,ye,xl,yb,xr,yb)
			||isIntersected(xs,ys,xe,ye,xl,yt,xr,yt)
			||isIntersected(xs,ys,xe,ye,xr,yb,xr,yt))
			printf("T\n");
		else
			printf("F\n");
	}
	return 0;
}