半平面交 poj 2451

poj 2451

 

#pragma GCC optimize(2)
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf  0x7fffffff
#define linf 0x7fffffffffffffff
#define mem(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define debug printf("!!\n");
#define N 20005
#define M 4000009
#define pi acos(-1)
#define eps 1e-8
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);// freopen("in.txt","r",stdin);
using namespace std;
typedef unsigned long long  ll;
typedef long long  LL;
typedef double db;
int dcmp(double x) {
    if (x<=eps&&x>=-eps) return 0;
    return (x>0)?1:-1;
}
struct Vector {
    double x,y;
    Vector(double X=0,double Y=0){
        x=X,y=Y;
    }
};
typedef Vector Point;

struct Line {
    Point p;
    Vector v;
    double ang;
    Line(Point P=Point(0,0),Vector V=Vector(0,0)) {
        p=P,v=V;
        ang=atan2(v.y,v.x);
    }
    bool operator < (const Line &a) const {
        return ang<a.ang;
    }
};
Vector operator + (Vector a,Vector b) {return Vector(a.x+b.x,a.y+b.y);}
Vector operator - (Vector a,Vector b) {return Vector(a.x-b.x,a.y-b.y);}
Vector operator * (Vector a,double b) {return Vector(a.x*b,a.y*b);}

int n,l,r,m,cnt;
double ans;
Line L[N],q[N];
Point p[N],poly[N];

double Cross(Vector a,Vector b) {
    return a.x*b.y-a.y*b.x;
}
Point GLI(Point P,Vector v,Point Q,Vector w) {
    Vector u=P-Q;
    double t=Cross(w,u)/Cross(v,w);
    return P+v*t;
}
bool Onleft(Line m,Point P) {
    Vector w=P-m.p;
    return dcmp(Cross(m.v,w))>=0;
}
void halfp(){
    sort(L+1,L+n+1);
    cnt=0;
    q[l=r=1]=L[1];
    for (int i=2;i<=n;++i) {
        while (l<r&&!Onleft(L[i],p[r-1])) --r;
        while (l<r&&!Onleft(L[i],p[l])) ++l;
        q[++r]=L[i];
        if (dcmp(Cross(q[r].v,q[r-1].v))==0) {
            --r;
            if (Onleft(q[r],L[i].p))
                q[r]=L[i];
        }
        if (l<r)
            p[r-1]=GLI(q[r-1].p,q[r-1].v,q[r].p,q[r].v);
    }
    while (l<r&&!Onleft(q[l],p[r-1]))
        --r;
    if (r-l<=1) return;
    p[r]=GLI(q[r].p,q[r].v,q[l].p,q[l].v);
    for (int i=l;i<=r;++i) poly[++cnt]=p[i];
}
double Area() {
    double ans=0;
    for (int i=2;i<cnt;++i)
        ans+=Cross(poly[i]-poly[1],poly[i+1]-poly[1]);
    return fabs(ans/2);
}

int main() {
    scanf("%d",&n); 
    for (int i=1;i<=n;++i) {
        Point P,Q;double a,b,c,d; 
        scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
        P=Point(a,b);Q=Point(c,d); 
        L[i]=Line(P,Q-P);
    } 
    L[++n]=Line(Point(0,0),Vector(10000,0));
    L[++n]=Line(Point(10000,0),Vector(0,10000));
    L[++n]=Line(Point(10000,10000),Vector(-10000,0));
    L[++n]=Line(Point(0,10000),Vector(0,-10000));
    halfp();
    printf("%.1lf\n",Area());
    return 0;
//1
}