2020牛客多校(第三场) C. Operation Love (几何)

Souce
2020牛客多校第三场 Problem C

Solution
题解做法简单明了：
判断输入的顺序(顺时针/逆时针)后，看边的出现顺序是9，8 还是 8，9 就可以判断答案了

判断输入顺序的方法：
按照输入顺序依次计算零点到相邻两个点的向量叉积和，如果是正数说明输入按照逆时针，反之为顺时针
这里所计算的叉积和 / 2 == 多边形面积(凹/凸)，面积为正时说明以逆时针枚举点，反之为顺时针

Hint
该题输入数据存在误差，注意误差范围的选取

Code

const double eps = 1e-4;
struct Point{
    double x,y;
    Point(double _x=0,double _y=0){
        x=_x;
        y=_y;
    }
    void read(){
        scanf("%lf %lf",&x,&y);
    }
    Point operator-(const Point& p1)const{return Point(x-p1.x,y-p1.y);}
    Point operator+(const Point& p1)const{return Point(x+p1.x,y+p1.y);}
    bool friend operator<(const Point& p1,const Point& p2){
        if(fabs(p1.x-p2.x)>eps)return p1.x<p2.x;return p1.y<p2.y;
    }
    bool friend operator==(const Point& p1,const Point& p2){
        if(fabs(p1.x-p2.x)>eps)return 0;
        if(fabs(p1.y-p2.y)>eps)return 0;
        return 1;
    }
    double friend operator^(const Point& p1,const Point& p2){return p1.x*p2.y-p2.x*p1.y;}
    Point friend operator*(const Point& p1,const double& k){return Point(p1.x*k,p1.y*k);}
    double friend operator*(const Point& p1,const Point& p2){return p1.x*p2.x+p1.y*p2.y;}
}a[20];


int main(){
    int T;scanf("%d",&T);
    while(T--){
        for(int i = 0;i < 20;++i){
            scanf("%lf %lf",&a[i].x,&a[i].y);
        }
        a[20] = a[0];
        double res = 0.0;
        for(int i = 0;i < 20;i++){
            res += (a[i].x * a[i+1].y - a[i].y * a[i+1].x);
        }
        if(res > 0){
            int ans = 0;
            for(int i = 0;i < 20;++i){
                double dis1 = (a[(i+1)%20].x - a[i].x) * (a[(i+1)%20].x - a[i].x) + (a[(i+1)%20].y - a[i].y) * (a[(i+1)%20].y - a[i].y);
                double dis2 = (a[(i+2)%20].x - a[(i+1)%20].x) * (a[(i+2)%20].x - a[(i+1)%20].x) + (a[(i+2)%20].y - a[(i+1)%20].y) * (a[(i+2)%20].y - a[(i+1)%20].y);
                if(fabs(dis1 - 81.0) < eps && fabs(dis2-64.0) < eps) {ans = 1;break;}
            }
            if(ans) printf("right\n"); else printf("left\n");
        } else{
            int ans = 0;
            for(int i = 0;i < 20;++i){
                double dis2 = (a[(i+1)%20].x - a[i].x) * (a[(i+1)%20].x - a[i].x) + (a[(i+1)%20].y - a[i].y) * (a[(i+1)%20].y - a[i].y);
                double dis1 = (a[(i+2)%20].x - a[(i+1)%20].x) * (a[(i+2)%20].x - a[(i+1)%20].x) + (a[(i+2)%20].y - a[(i+1)%20].y) * (a[(i+2)%20].y - a[(i+1)%20].y);
                if(fabs(dis1 - 81.0) < eps && fabs(dis2-64.0) < eps) {ans = 1;break;}
            }
            if(ans) printf("right\n"); else printf("left\n");
        }
    }    
    return 0;
}