HDU 5484 Monitor the Alpacas 凸包＋Dijkstra

题意 给你n个点  m个点  问m个点中最少几个 可以把 n个点围起来

思路：先凸包一下，然后 把凸包的线存起来，枚举m个点可组成的线段是否在凸包外面，然后 枚举m个点 最短环用Dijkstra就可以了

代码：

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
const double eps=1e-10;
inline int dcmp(double x)
{
    if(fabs(x) < eps) return 0;
    else return x < 0 ? -1 : 1;
}
struct Point
{
    double x, y;
    Point(double x=0, double y=0):x(x),y(y) { }
    
};
typedef vector<Point> Polygon;
typedef Point Vector;
typedef pair<int,int> pii;
inline Vector operator+ (Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }
inline Vector operator- (Point A, Point B) { return Vector(A.x - B.x, A.y - B.y); }
inline Vector operator* (Vector A, double p) { return Vector(A.x * p, A.y * p); }
inline Vector operator/ (Vector A, double p) { return Vector(A.x / p, A.y / p); }
inline bool operator == (Point a, Point b) { return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0; }
inline bool operator < (Point a, Point b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
inline double Dot(Vector A, Vector B){ return A.x * B.x + A.y * B.y;}
inline double Cross(Vector A, Vector B) { return A.x * B.y - A.y * B.x; }
inline bool OnSegment(Point p, Point a1, Point a2)
{
    return dcmp(Cross(a1-p, a2-p)) == 0 && dcmp(Dot(a1-p, a2-p)) <= 0;
}
struct Line
{
    Point p, q;    // 直线上任意一点,p作为起点
    Vector v;   // 方向向量
    double ang; // 极角，即从x正半轴旋转到向量v所需要的角（弧度）
    Line(){}
    Line(Point P, Point Q):p(P), q(Q)
    {
        v = q - p;
        ang = atan2(v.y, v.x);
    }
    inline bool operator < (const Line& L) const
    {
        return ang < L.ang;
    }
}l[100000+100];
vector<Point> ConvexHull(vector<Point>& p)
{
    // 预处理，删除重复点
    sort(p.begin(), p.end());
    //  p.erase(unique(p.begin(), p.end()), p.end());
    
    
    int n = p.size();
    int m = 0;
    vector<Point> ch(n+1);
    for(int i = 0; i < n; i++)
    {
        while(m > 1 && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
        ch[m++] = p[i];
    }
    int k = m;
    for(int i = n-2; i >= 0; i--)
    {
        while(m > k && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2]) <= 0) m--;
        ch[m++] = p[i];
    }
    if(n > 1) m--;
    ch.resize(m);
    return ch;
}
int g[505][505];
int dis[505];int n,m;
int dij(int s){
    priority_queue<pii,vector<pii>,greater<pii> > q;
    memset(dis,0x3f3f3f3f,sizeof(dis));
    dis[s]=0;
    q.push(pii(0,s));
    while (!q.empty()) {
        int d=q.top().first,p=q.top().second;q.pop();
        if (g[p][s])
            return d+1;
        if(d>dis[p])
            continue;
        for (int i=0; i<m; ++i) {
            if (g[p][i]&&dis[i]>dis[p]+1) {
                dis[i]=dis[p]+1;
                q.push(pii(dis[i],i));
            }
        }
    }
    return 0x3f3f3f3f;
}
int main(int argc, const char * argv[]) {
    int t;
    cin>>t;
    Polygon a,b;
    for (int ca=1; ca<=t; ++ca) {
        memset(g,0,sizeof(g));
        scanf("%d%d",&n,&m);
        a.resize(n);
        b.resize(m);
        for (int i=0; i<n; ++i)
            scanf("%lf%lf", &a[i].x, &a[i].y);
        a=ConvexHull(a);
        n=a.size();
        for (int i=0;i<n;++i)
            l[i]={a[i],a[(i+1)%n]};
        sort(l,l+n);
        cout<<"Case #"<<ca<<": ";
        bool ok=false;
        for (int i=0; i<m; ++i) {
            scanf("%lf%lf",&b[i].x,&b[i].y);
            if(!ok&&a[0]==b[i])
                ok=1;
        }
        if(n==1&&ok) {
            puts("1");
        }
        else{
            ok=false;
            Point o(0,0);
            for (int i=0; i<m; ++i) {
                for (int j=0; j<m; ++j) {
                    if (i==j)
                        continue;
                    if (n==1&&OnSegment(a[0],b[i],b[j])) {
                        ok=true;
                        break;
                    }
                    if (n==2&&OnSegment(a[0],b[i],b[j])&&OnSegment(a[1],b[i],b[j])) {
                        ok=true;
                        break;
                    }
                    Vector v=b[j]-b[i];
                    int id=upper_bound(l,l+n,Line(o,o+v))-l;
                    id=(id+n)%n;
                    if (n>2&&Cross(v,l[id].p-b[i])>=0&&Cross(v, l[id].q-b[i])>=0) {
                        g[i][j]=1;
                    }
                }
                if (ok)
                    break;
            }
            if (ok)
                puts("2");
            else {
                int ans=1000;
                for (int i=0; i<m;++i )
                    ans=min(ans,dij(i));
                if (ans==1000) {
                    puts("-1");
                }
                else  printf("%d\n",ans);
            }
        }
    }
    return 0;
}