poj 1410

Intersection

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5892		Accepted: 1484

Description

You are to write a program that has to decide whether a given line segment intersects a given rectangle.

An example:
line: start point: (4,9)
end point: (11,2)
rectangle: left-top: (1,5)
right-bottom: (7,1)


Figure 1: Line segment does not intersect rectangle

The line is said to intersect the rectangle if the line and the rectangle have at least one point in common. The rectangle consists of four straight lines and the area in between. Although all input values are integer numbers, valid intersection points do not have to lay on the integer grid.

Input

The input consists of n test cases. The first line of the input file contains the number n. Each following line contains one test case of the format:
xstart ystart xend yend xleft ytop xright ybottom

where (xstart, ystart) is the start and (xend, yend) the end point of the line and (xleft, ytop) the top left and (xright, ybottom) the bottom right corner of the rectangle. The eight numbers are separated by a blank. The terms top left and bottom right do not imply any ordering of coordinates.

Output

For each test case in the input file, the output file should contain a line consisting either of the letter "T" if the line segment intersects the rectangle or the letter "F" if the line segment does not intersect the rectangle.

Sample Input

1
4 9 11 2 1 5 7 1

Sample Output

F

Source

Southwestern European Regional Contest 1995

 

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