题解 UVA10084 【Hotter Colder】

题目链接：Link

Solution

每次询问都能得到一个半平面，它们的并就是可能的区域（别忘了考虑房间的边界），特判一下“Same”就行了。

贴代码：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
struct Point
{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}
};
typedef Point Vector;

inline Vector operator+(const Vector &A,const Vector &B)
{ return Vector(A.x+B.x,A.y+B.y); }

inline Vector operator-(const Point &a,const Point &b)
{ return Vector(a.x-b.x,a.y-b.y); }

inline Vector operator*(const Vector &A,double p)
{ return Vector(A.x*p,A.y*p); }

inline Vector operator/(const Vector &A,double p)
{ return Vector(A.x/p,A.y/p); }

inline bool operator<(const Point &a,const Point &b)
{ return a.x<b.x||(a.x==b.x&&a.y<b.y); }

const double ops=1e-10;
inline int dcmp(double x)
{ return (x>0?x:-x)<ops?0:(x>0?1:-1); }

inline bool operator==(const Point &a,const Point &b)
{ return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0; }

inline double Dot(const Vector &A,const Vector &B)
{ return A.x*B.x+A.y*B.y; }

inline double Length(const Vector &A)
{ return sqrt(Dot(A,A)); }

inline double Cross(const Vector &A,const Vector &B)
{ return A.x*B.y-A.y*B.x; }

inline Vector Normal(const Vector &A)
{
    double L=Length(A);
    return Vector(-A.y/L,A.x/L);
}

struct Line
{
    Point P;
    Vector v;
    double ang;
    Line(Point P=Point(),Vector v=Vector()):P(P),v(v) { ang=atan2(v.y,v.x); }
    inline bool operator<(const Line &L) const
    { return ang<L.ang; }
};

inline bool OnLeft(const Line &L,const Point &p)
{ return dcmp(Cross(L.v,p-L.P))>0; }

Point GetLineIntersection(const Line &a,const Line &b)
{
    Vector u=a.P-b.P;
    double t=Cross(b.v,u)/Cross(a.v,b.v);
    return a.P+a.v*t;
}

int HalfplaneIntersection(Line *L,int n,Point *poly)
{
    sort(L,L+n);
    int first,last;
    Point *p=new Point[n];
    Line *q=new Line[n];
    q[first=last=0]=L[0];
    for(int i=1;i<n;i++)
    {
        while(first<last&&!OnLeft(L[i],p[last-1])) last--;
        while(first<last&&!OnLeft(L[i],p[first])) first++;
        q[++last]=L[i];
        if(dcmp(Cross(q[last].v,q[last-1].v))==0)
        {
            last--;
            if(OnLeft(q[last],L[i].P)) q[last]=L[i];
        }
        if(first<last) p[last-1]=GetLineIntersection(q[last-1],q[last]);
    }
    while(first<last&&!OnLeft(q[first],p[last-1])) last--;
    if(last-first<=1) return 0;
    p[last]=GetLineIntersection(q[last],q[first]);
    
    int m=0;
    for(int i=first;i<=last;i++) poly[m++]=p[i];
    return m;
}

inline double PolygonArea(Point* p,int n)
{
    double area=0;
    for(int i=1;i<n-1;i++)
        area+=Cross(p[i]-p[0],p[i+1]-p[0]);
    return area/2;
}

Point A(0,0),B;
char cmd[20];
bool Samed;
Line L[70]=
{
    Line(Point(0,0),Vector(1,0)),
    Line(Point(10,0),Vector(0,1)),
    Line(Point(10,10),Vector(-1,0)),
    Line(Point(0,10),Vector(0,-1))
};
int cnt=4;
Point p[70];
int main()
{
#ifdef local
    freopen("pro.in","r",stdin);
#endif
    while(scanf("%lf%lf%s",&B.x,&B.y,cmd)==3)
    {
        if(strcmp(cmd,"Same")==0) Samed=true;
        if(Samed) printf("0.00\n");
        else
        {
            Point O=(A+B)/2;
            if(strcmp(cmd,"Colder")==0) L[cnt++]=Line(O,Normal(O-A));
            else L[cnt++]=Line(O,Normal(O-B));
            int m=HalfplaneIntersection(L,cnt,p);
            printf("%.2lf\n",PolygonArea(p,m));
        }
        A=B;
    }
    return 0;
}

转载于:https://www.cnblogs.com/happyZYM/p/11380116.html