I - Land Division Gym - 101243I 计算几何 切割凸包

题意：

给出一个n个顶点的凸包，将此凸包分为两个多边形，得到的凸包的顶点数是m  k

若不能分割得到这样的顶点数的凸包就输出 -1

题解：

分四种情况，自己可以在草稿上完成，即是否从顶点开始切割凸包

#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

#define MAXN 110
#define INF 0x3f3f3f3f
const double eps=-0x3f3f3f;

struct Point
{
    double x,y;
    Point(){}
    Point(double xx,double yy){
        x=xx,y=yy;
    }
};
Point P[MAXN];

double Cross(Point p1,Point p2,Point p3){
    return (p2.x-p1.x)*(p3.y-p1.y)-(p2.y-p1.y)*(p3.x-p1.x);
}
double dot_mul(Point p1,Point p2,Point p3){
    return (p2.x-p1.x)*(p3.x-p1.x)+(p2.y-p1.y)*(p3.y-p1.y);
}
double Dis(Point A, Point B){
    return sqrt((A.x-B.x)*(A.x-B.x) + (A.y-B.y)*(A.y-B.y));
}
Point operator - (Point A,Point B){
    return Point(A.x-B.x, A.y-B.y);
}
Point operator + (Point A, Point B){
    return Point(A.x+B.x, A.y+B.y);
}
Point operator * (Point A, double p){
    return Point(A.x*p, A.y*p);
}
bool operator == (Point A, Point B){
    return (A.x-B.x) == 0 && (A.y-B.y) == 0;
}

double calc(Point p0,Point p1,Point p2)
{
    double d=fabs(Cross(p0,p1,p2)/Dis(p1,p2));
    //角p0p1p2为钝角或者p0p2p1为钝角
    if(dot_mul(p2,p0,p1)<0 || dot_mul(p1,p0,p2)<0)
        return min(Dis(p0,p1),Dis(p0,p2));
    return d;
}

void solve1(int n,int m,int k)
{
    double ans=INF;
    for(int i=0;i<n;i++)
        ans=min(ans,Dis(P[i],P[(i+m-1)%n]));
    printf("%0.3lf\n",ans);
}

void solve2(int n,int m,int k)
{
    double ans=INF;
    for(int i=0;i<n;i++){
        ans=min(ans,calc(P[i],P[(i+m-1)%n],P[(i+m-2)%n]));
        ans=min(ans,calc(P[(i+m-1)%n],P[i],P[(i+1)%n]));
    }
    printf("%0.3lf\n",ans);
}

void solve3(int n,int m,int k)
{
    double ans=INF;
    for(int i=0;i<n;i++)
    {
        ans=min(ans,calc(P[i],P[(i+m-1)%n],P[(i+m-2)%n]));
        ans=min(ans,calc(P[(i+1)%n],P[(i+m-1)%n],P[(i+m-2)%n]));
        ans=min(ans,calc(P[(i+m-1)%n],P[i],P[(i+1)%n]));
        ans=min(ans,calc(P[(i+m-2)%n],P[i],P[(i+1)%n]));
    }
    printf("%0.3lf\n",ans);
}

int main()
{
    int n,m,k;
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&P[i].x,&P[i].y);

        if(m+k-2==n)
            solve1(n,m,k);
        else if(m+k-3==n)
            solve2(n,m,k);
        else if(m+k-4==n)
            solve3(n,m,k);
        else
            printf("-1\n");
    }
    return 0;
}