poj1584 凸包判断及与圆的相交

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
#include<stdlib.h>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
#define rd(x) scanf("%d",&x)
#define rdd(x,y) scanf("%d%d",&x,&y)
#define rddd(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define rdddd(x,y,z,w) scanf("%d%d%d%d",&x,&y,&z,&w)
#define rds(s) scanf("%s",s)
#define rep(i,n) for(int i=0;i<n;i++)
#define LL long long
const int N = 1e5+10;
const int M=5e5+10;
const int inf=1e9;
const double eps=1e-8;
const int MOD=1e9+7;
int n,m,k;
struct Point{
    double x,y;
    Point(){}
    Point(double _x,double _y){
        x=_x;y=_y;
    }
    Point operator - (const Point o) const{
        return Point(x-o.x,y-o.y);
    }
};
double dist(Point a,Point b){
    return sqrt((a.x-b.x)*(a.x-b.