Intersecting Lines（判断两条直线的位置，模板）

缺乏、安全感 2022-08-02 06:13 149阅读 0赞

Intersecting Lines

<table> 
 <tbody> 
  <tr> 
   <td><strong>Time Limit:</strong>&nbsp;1000MS</td> 
   <td>&nbsp;</td> 
   <td><strong>Memory Limit:</strong>&nbsp;10000K</td> 
  </tr> 
  <tr> 
   <td><strong>Total Submissions:</strong>&nbsp;12164</td> 
   <td>&nbsp;</td> 
   <td><strong>Accepted:</strong>&nbsp;5442</td> 
  </tr> 
 </tbody> 
</table>

Description

We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect in a line because they are on top of one another (i.e. they are the same line), 3) intersect in a point. In this problem you will use your algebraic knowledge to create a program that determines how and where two lines intersect.   
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.

Input

The first line contains an integer N between 1 and 10 describing how many pairs of lines are represented. The next N lines will each contain eight integers. These integers represent the coordinates of four points on the plane in the order x1y1x2y2x3y3x4y4. Thus each of these input lines represents two lines on the plane: the line through (x1,y1) and (x2,y2) and the line through (x3,y3) and (x4,y4). The point (x1,y1) is always distinct from (x2,y2). Likewise with (x3,y3) and (x4,y4).

Output

There should be N+2 lines of output. The first line of output should read INTERSECTING LINES OUTPUT. There will then be one line of output for each pair of planar lines represented by a line of input, describing how the lines intersect: none, line, or point. If the intersection is a point then your program should output the x and y coordinates of the point, correct to two decimal places. The final line of output should read "END OF OUTPUT".

Sample Input

5
    0 0 4 4 0 4 4 0
    5 0 7 6 1 0 2 3
    5 0 7 6 3 -6 4 -3
    2 0 2 27 1 5 18 5
    0 3 4 0 1 2 2 5

Sample Output

INTERSECTING LINES OUTPUT
    POINT 2.00 2.00
    NONE
    LINE
    POINT 2.00 5.00
    POINT 1.07 2.20
     END OF OUTPUT 
     #include<cstdio>
    #include<iostream>
    #include<algorithm>
    const double eps=1E-8;//注意精度double
    using namespace std;
    struct Point
    {
        double x;
        double y;
    };
    int sig(double d)
    {
        return (d > eps) - (d < -eps);
    }
    double Cross(const Point& o,const Point& a,const Point& b)
    {
        return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);
    }
    int LineCross(const Point& a,const Point&b,const Point& c ,const Point& d,Point &p)
    {
        double s1,s2;
        s1 = Cross(a,b,c);
        s2 = Cross(a,b,d);
        if(sig(s1)==0&&sig(s2)==0)
            return 2;  //相交并且在同一条直线上
        if(sig(s2-s1)==0)
            return 0;  //平行
        p.x = (c.x * s2 - d.x * s1)/(s2 - s1);
        p.y = (c.y * s2 - d.y * s1)/(s2 - s1);
        return 1;  //相交，并求出了交点
    }
    int main()
    {
        int n,ans;
        Point a,b,c,d,e;
        cin>>n;
        cout<<"INTERSECTING LINES OUTPUT"<<endl;
        while(n--)
        {
            cin>>a.x>>a.y>>b.x>>b.y>>c.x>>c.y>>d.x>>d.y;
            ans=LineCross(a,b,c,d,e);
            if(ans==2)
            {
                cout<<"LINE"<<endl;
            }
            else if(ans==0)
            {
                cout<<"NONE"<<endl;
            }
            else
            {
                printf("POINT %.2f %.2f\n",e.x,e.y);
            }
        }
        cout<<"END OF OUTPUT"<<endl;
    }
    
    
     需要注意的一点就是G++用%.f会AC，%.lf会WA，C++不会！