H. Are You Safe?

https://codeforc.es/gym/102219/problem/H

思路：判断点是否在凸包内，是则unsafe，包含边上的；

总结：非极角排序求凸包；

坑：逆时针输出，极角排序顺序不行；

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

struct point
{
    double x,y;
    point friend operator - (point a,point b)
    {
        return {a.x-b.x,a.y-b.y};
    }
}p[maxn],s[maxn],query[maxn];

double dis(point a,point b)
{
    point c=a-b;
    return sqrt(c.x*c.x+c.y*c.y);
}

double chax(point a,point b)//叉乘
{
    return a.x*b.y-a.y*b.x;
}

bool cmp(point a,point b)//极角排序
{
    double x=chax(a-p[1],b-p[1]);//以p[1]为积点

    if(x>0) return 1;//让a处于b的顺时针
    if(x==0&&dis(a,p[1])<dis(b,p[1])) return 1;//角度相同按距离排序
    return 0;
}

double mulx(point p1,point p2,point p3)
{
    return chax(p2-p1,p3-p1);
}

double p_area(point *p,int n)
{
    if(n<3) return 0;
    p[n+1]=p[1];
    double sum=0;
    for(int i=1;i<=n;i++)
    {
        sum+=p[i].x*p[i+1].y-p[i].y*p[i+1].x;//不管这个多边形在哪，都以原点为分割点，就算原点在外面也可以算出，因为有正负可以抵消掉多余的
    }
    sum=fabs(sum/2.0);
    return sum;
}

bool intubao(point *s,int n,point a)
{
    int f=0;
    for(int i=0;i<n;i++)
    {
        if(chax(s[(i+1)%n]-s[i],a-s[i])>0) f++;
    }
    //if(chax(s[1]-s[n],a-s[n])>0) f++;
    if(f==n) return 1;
    return 0;
}

bool cmp2(point a,point b)
{
    if (a.x!=b.x)
        return a.x<b.x;
    return a.y<b.y;
}

int main()
{
    //FAST_IO;

    int T;
    cin>>T;
    int cas=0;
    while(T--)
    {
        int n,q;
        cin>>n>>q;
        for(int i=0;i<n;i++)
        {
            cin>>p[i].x>>p[i].y;
        }

        //找到最左下的点

        sort(p,p+n,cmp2);

        /*fl();
        for(int i=1;i<=n;i++)
        {
            cout<<p[i].x<<" "<<p[i].y<<endl;
        }
        fl();*/


        int m=0;
        for(int i=0;i<n;i++)
        {
            while(m>1&&mulx(s[m-2],s[m-1],p[i])<=0) m--;
            s[m++]=p[i];
        }
        int kk=m;
        for(int i=n-2;i>=0;i--)
        {
            while(m>kk&&mulx(s[m-2],s[m-1],p[i])<=0) m--;
            s[m++]=p[i];
        }
        if(n>1)
            m--;

        for(int i=0;i<q;i++)
        {
            cin>>query[i].x>>query[i].y;
        }

        printf("Case %d\n",++cas);
        for(int i=0;i<m;i++)
        {
            cout<<s[i].x<<" "<<s[i].y<<endl;
        }
        cout<<s[0].x<<" "<<s[0].y<<endl;
        for(int i=0;i<q;i++)
        {
            cout<<query[i].x<<" "<<query[i].y<<" ";
            if(intubao(s,m,query[i])) cout<<"is unsafe!\n";
            else cout<<"is safe!\n";
        }
        puts("");

    }

    return 0;
}