学步园

Description

Input

Output

Sample Input

1
4 9 11 2 1 5 7 1

Sample Output

F

Source

//注意输入的排序，保证是左上点和右下点<br /> //在正方形当中也是T<br /> #include<cstdio><br /> #include<iostream><br /> #include<algorithm><br /> using namespace std;<br /> struct Point<br /> {<br /> double x,y;<br /> Point(double a=0,double b=0)<br /> {<br /> x=a;<br /> y=b;<br /> }<br /> };<br /> struct Lineser<br /> {<br /> Point s,e;<br /> Lineser(Point a,Point b)<br /> {<br /> s=a;<br /> e=b;<br /> }<br /> Lineser() {}<br /> };<br /> double multiply(Point sp,Point ep,Point op)<br /> {<br /> return((sp.x-op.x)*(ep.y-op.y)-(ep.x-op.x)*(sp.y-op.y));<br /> }<br /> bool intersect(Lineser u,Lineser v)<br /> {<br /> return( (max(u.s.x,u.e.x)>=min(v.s.x,v.e.x))&& //排斥实验<br /> (max(v.s.x,v.e.x)>=min(u.s.x,u.e.x))&&<br /> (max(u.s.y,u.e.y)>=min(v.s.y,v.e.y))&&<br /> (max(v.s.y,v.e.y)>=min(u.s.y,u.e.y))&&<br /> (multiply(v.s,u.e,u.s)*multiply(u.e,v.e,u.s)>=0)&& //跨立实验<br /> (multiply(u.s,v.e,v.s)*multiply(v.e,u.e,v.s)>=0));<br /> }<br /> int main()<br /> {<br /> int t;<br /> scanf("%d",&t);<br /> while(t--)<br /> {<br /> Point s,e;<br /> Point l,r;<br /> double x1,y1,x2,y2;<br /> cin>>s.x>>s.y>>e.x>>e.y>>l.x>>l.y>>r.x>>r.y;<br /> x1=min(l.x,r.x);<br /> y1=max(l.y,r.y);<br /> x2=max(l.x,r.x);<br /> y2=min(l.y,r.y);<br /> Point a(x1,y1),b(x2,y1),d(x2,y2),c(x1,y2);<br /> if(intersect(Lineser(a,b),Lineser(s,e)))<br /> {<br /> printf("T/n");<br /> continue;<br /> }<br /> //cout<<"111111111"<<endl;<br /> if(intersect(Lineser(a,c),Lineser(s,e)))<br /> {<br /> printf("T/n");<br /> continue;<br /> }<br /> if(intersect(Lineser(b,d),Lineser(s,e)))<br /> {<br /> printf("T/n");<br /> continue;<br /> }<br /> if(intersect(Lineser(c,d),Lineser(s,e)))<br /> {<br /> printf("T/n");<br /> continue;<br /> }<br /> if((s.x>x1&&s.x<x2)&&(e.x>x1&&e.x<x2)&&(s.y<y1&&s.y>y2)&&(e.y<y1&&e.y>y2))<br /> {<br /> printf("T/n");<br /> continue;<br /> }<br /> printf("F/n");<br /> }<br /> return 0;<br /> }<br />