【凸包】HDU - 6590 - CODE

题目链接<http://acm.hdu.edu.cn/showproblem.php?pid=6590>

---

题意

不知道。
翻译过来是平面上给出两种点，每种点有若干个，问能否划出一条直线把这两种点分开。

---

题解

做两个凸包，然后暴力判断凸包上的点是否在另一个凸包内，以及线段是否存在相交即可。

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=1e5+7;
const db eps=1e-7;
const db pi=acos(-1.0);
bool sign(db k){
    if(k>eps) return 1;
    if(k<-eps) return -1;
    return 0;
}
bool dcmp(db k1,db k2){
    return sign(k1-k2);
}
struct point{
    db x,y;
    point operator - (const point k)const{
        return (point){x-k.x,y-k.y};
    }
    db abs(){return sqrt(x*x+y*y);}
};
db cross(point k1,point k2){return k1.x*k2.y-k1.y*k2.x;}
db dot(point k1,point k2){return k1.x*k2.x+k1.y*k2.y;}
db angle(point k1,point k2){return acos(dot(k1,k2)/k1.abs()/k2.abs());}
bool cmp(point p1,point p2){
    if(dcmp(p1.x,p2.x)==0) return p1.y<p2.y;
    return p1.x<p2.x;
}
vector<point> convexHull(vector<point> p){
    int sz=p.size(),tp=0;
    if(sz<=1) return p;
    vector<point>res(sz*2);
    sort(p.begin(),p.end(),cmp);
    for(int i=0;i<sz;i++){
        while(tp>=2&&cross(res[tp-1]-res[tp-2],p[i]-res[tp-2])<eps) tp--;
        res[tp++]=p[i];
    }
    int lst=tp+1;
    for(int i=sz-2;i>=0;i--){
        while(tp>=lst&&cross(res[tp-1]-res[tp-2],p[i]-res[tp-2])<eps) tp--;
        res[tp++]=p[i];
    }
    res.resize(tp-1);
    return res;
}
bool inPoly(point x,const vector<point> &p){
    db alpha=0;
    for(int i=0;i<p.size();i++){
        alpha+=fabs(angle(p[i]-x,p[(i+1)%p.size()]-x));
    }
    return dcmp(alpha,2*pi)==0;
}
int intersect(db l1,db r1,db l2,db r2){
    if (l1>r1) swap(l1,r1); if (l2>r2) swap(l2,r2); return dcmp(r1,l2)!=-1&&dcmp(r2,l1)!=-1;
}
int checkSS(point k1,point k2,point k3,point k4){
    return intersect(k1.x,k2.x,k3.x,k4.x)&&intersect(k1.y,k2.y,k3.y,k4.y)&&
    sign(cross(k3-k1,k4-k1))*sign(cross(k3-k2,k4-k2))<=0&&
    sign(cross(k1-k3,k2-k3))*sign(cross(k1-k4,k2-k4))<=0;
}
int t,n;
vector<point>p1;
vector<point>p2;
bool ck(){
    for(int i=0;i<p1.size();i++){
        if(inPoly(p1[i],p2)) return false;
    }
    for(int i=0;i<p2.size();i++){
        if(inPoly(p2[i],p1)) return false;
    }
    if(p1.size()<=1||p2.size()<=1) return true;
    for(int i=0;i<p1.size();i++){
        for(int j=0;j<p2.size();j++){
            if(checkSS(p1[i],p1[(i+1)%p1.size()],p2[j],p2[(j+1)%p2.size()])) return false;
        }
    }
    return true;
}
int main()
{
    scanf("%d",&t);
    while(t--){
        p1.clear();p2.clear();
        scanf("%d",&n);
        point tmp;
        for(int i=1,o;i<=n;i++){
            scanf("%lf%lf%d",&tmp.x,&tmp.y,&o);
            if(o==1) p1.push_back(tmp);
            else p2.push_back(tmp);
        }
        if(p1.size()==0||p2.size()==0){
            printf("Successful!\n");
            continue;
        }
        p1=convexHull(p1);
        p2=convexHull(p2);
        if(ck()) printf("Successful!\n");
        else printf("Infinite loop!\n");
    }
}