zoukankan      html  css  js  c++  java
  • POJ-1410

    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 12817   Accepted: 3343

    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

    题意:给一条线段,然后是一个矩形,问线段是否与矩形相交
        kuangbin模版
    #include <iostream>
    #include <stdio.h>
    #include <algorithm>
    #include <string.h>
    #include <cmath>
    #define eps 1e-8
    #define maxn 100
    using namespace std;
    int sgn(double x)
    {
        if(abs(x) < eps) return 0;
        if(x<0) return -1;
        else return 1;
    }
    struct Point
    {
        double x;
        double y;
        Point(){}
        Point(double _x,double _y)
        {
            x = _x;
            y = _y;
        }
        Point operator -(const Point &a) const
        {
            return Point(x-a.x,y-a.y);
        }
        Point operator + (const Point &a) const
        {
            return Point(x+a.x,y+a.y);
        }
        double  operator *(const Point &a) const
        {
            return x*a.x+y*a.y;
        }
        double  operator ^(const Point &a) const
        {
            return x*a.y-y*a.x;
        }
    };
    struct Line
    {
        Point s;
        Point e;
        Line(){}
        Line(Point _s,Point _e)
        {
            s = _s;
            e = _e;
        }
    };
    ///判断线段相交
    bool inter(Line l1,Line l2)
    {
        return
        max(l1.s.x,l1.e.x) >= min(l2.s.x,l2.e.x) &&
        max(l2.s.x,l2.e.x) >= min(l1.s.x,l1.e.x) &&
        max(l1.s.y,l1.e.y) >= min(l2.s.y,l2.e.y) &&
        max(l2.s.y,l2.e.y) >= min(l1.s.y,l1.e.y) &&
        sgn((l2.s-l1.e)^(l1.s-l1.e))*sgn((l2.e-l1.e)^(l1.s-l1.e)) <= 0&&
        sgn((l1.s-l2.e)^(l2.s-l2.e))*sgn((l1.e-l2.e)^(l2.s-l2.e)) <=0;
    }
    ///判断直线和线段是否相交
    bool seg_inter_line(Line l1,Line l2)
    {
        return sgn((l2.s-l1.e)^(l1.s-l1.e))*sgn((l2.e-l1.e)^(l1.s,l1.e)) <=0;
    }
    bool Onseg(Point p,Line L)
    {
        return
        sgn((L.s-p)^(L.e-p)) == 0 &&
        sgn((p.x-L.s.x)*(p.x-L.e.x)) <= 0 &&
        sgn((p.y-L.s.y)*(p.y-L.e.y)) <= 0;
    }
    int inConvexpoly(Point a,Point p[],int n)
    {
        for(int i=0;i<n;i++)
        {
            if(sgn((p[i]-a)^(p[(i+1)%n]-a)) < 0) return -1;
            else if(Onseg(a,Line(p[i],p[(i+1)%n]))) return 0;
        }
        return 1;
    }
    int main()
    {
        //freopen("in.txt","r",stdin);
        int T;
        scanf("%d",&T);
        while(T--)
        {
            Point s;
            Point e;
            double  x1,y1,x2,y2;
            scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&s.x,&s.y,&e.x,&e.y,&x1,&y1,&x2,&y2);
            if(x1 > x2) swap(x1,x2);
            if(y1 > y2) swap(y1,y2);
            Point p[10];
            Line L = Line(s,e);
            p[0] = Point(x1,y1);
            p[1] = Point(x2,y1);
            p[2] = Point(x2,y2);
            p[3] = Point(x1,y2);
            if(inter(L,Line(p[0],p[1])))
            {
                printf("T
    ");
                continue;
            }
            else if(inter(L,Line(p[1],p[2])))
            {
                printf("T
    ");
                continue;
            }
            else if(inter(L,Line(p[2],p[3])))
            {
                printf("T
    ");
                continue;
            }
            else if(inter(L,Line(p[3],p[0])))
            {
                printf("T
    ");
                continue;
            }
            else if(inConvexpoly(L.s,p,4)>=0 || inConvexpoly(L.e,p,4)>=0)
            {
                 printf("T
    ");
                continue;
            }
            else
                printf("F
    ");
        }
        return 0;
    }
  • 相关阅读:
    Django的模型层(1)- 单表操作(上)
    Django-1版本的路由层、Django的视图层和模板层
    Django准备知识-web应用、http协议、web框架、Django简介
    MySQL数据库(5)- pymysql的使用、索引
    MySQL数据库(4)- 多表查询、可视化工具Navicat的使用、设计模式MVC
    MySQL练习题
    MySQL数据库(3)- 完整性约束、外键的变种、单表查询
    MySQL数据库(2)- 库的操作、表的操作、数据的操作、存储引擎的介绍
    MySQL数据库(1)- 数据库概述、MySQL的安装与配置、初始SQL语句、MySQL创建用户和授权
    前端收尾
  • 原文地址:https://www.cnblogs.com/chenyang920/p/4733155.html
Copyright © 2011-2022 走看看