poj【3130】【计算几何】【半平面交】【多边形的核】How I Mathematician Wonder What You Are!

here
题目大概就是给出了一个多边形，判断这个正多边形有没有核
核就是这个区域可以看见多边形的所有位置。

参考了博客：here以及here以及here都是一个人写的 哈哈哈哈哈

这个代码量，感人，真的是吐了。眼都花了

//god with me 
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
//#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
//#define double long long
#define re int
//#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define mk make_pair
#define P pair < int , int >
#define pd pair <double,double>
#define x first
#define y second
#define db double
using namespace std;
const int mod=4933;
//const int inf=1e18;
const int M=1e8;
const int N=1e5+5;//??????.???? 4e8

int n;

int sgn(db x)
{
	if(fabs(x)<eps) return 0;
	if(x<0) return -1;
	else return 1;
}

struct Point
{
	db x,y;
	Point(){}
	Point (db _x,db _y)
	{
		x=_x;y=_y;
	}
	Point operator -(const Point &b)const
	{
		return Point(x-b.x,y-b.y);
	}
	db operator ^(const Point &b)const
	{
		return x*b.y-y*b.x;
	}
	db operator *(const Point &b)const
	{
		return x*b.x+y*b.y;
	}
};

struct Line
{
	Point s,e;
	db k;
	Line(){}
	Line(Point _s,Point _e)
	{
		s=_s;e=_e;
		k=atan2(e.y-s.y,e.x-s.x);
	}
	Point operator &(const Line &b)const
	{
		Point res=s;
		db t=((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));
		res.x+=(e.x-s.x)*t;
		res.y+=(e.y-s.y)*t;
		return res;
	}
};

Line Q[N];
Point p[N];
Line line[N];
Point pp[N];

bool HPIcmp(Line a,Line b)
{
	if(fabs(a.k-b.k)>eps) return a.k<b.k;
	return ((a.s-b.s)^(b.e-b.s))<0;
} 

void HPI(Line line[],int n, Point res[],int &resn)
{
	int tot=n;
	sort(line,line+n,HPIcmp);
	tot=1;
	for(int i=1;i<n;i++)
	{
		if(fabs(line[i].k-line[i-1].k)>eps) line[tot++]=line[i];
	}
	int head=0,tail=1;
	Q[0]=line[0];
	Q[1]=line[1];
	resn=0;
	for(int i=2;i<tot;i++)
	{
		if(fabs((Q[tail].e-Q[tail].s)^(Q[tail-1].e-Q[tail-1].s))<eps ||
		fabs((Q[head].e-Q[head].s)^(Q[head+1].e-Q[head+1].s))<eps) return;
		while(head<tail&&(((Q[tail]&Q[tail-1])-
		line[i].s)^(line[i].e-line[i].s))>eps)tail--;
		while(head<tail&&(((Q[head]&Q[head+1])-
		line[i].s)^(line[i].e-line[i].s))>eps)head++;
		Q[++tail]=line[i];
	}
	while(head<tail&&(((Q[tail]&Q[tail-1])-
	Q[head].s)^(Q[head].e-Q[head].s))>eps)tail--;
	while(head<tail&&(((Q[head]&Q[head-1])-
	Q[tail].s)^(Q[head].e-Q[head].e))>eps)head++;
	if(tail<=head+1) return;
	for(int i=head;i<tail;i++)res[resn++]=Q[i]&Q[i+1];
	if(head<tail-1)res[resn++]=Q[head]&Q[tail]; 
}

void solve()
{
	int i,resn;
	while(~scanf("%d",&n)&&n)
	{
		for(i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y);
		
		for(i=0;i<n-1;i++)line[i]=Line(p[i],p[i+1]);
		line[i]=Line(p[i],p[0]);
		HPI(line,n,pp,resn);
		if(resn) printf("1\n");
		else printf("0\n");
	}
}

signed main()
{
    int T=1;      
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*


*/