2020牛客多校第三场C

Alice is a beauty in a robot society. So many robots want to marry
her. Alice determines to marry a robot who can solve the following
puzzle:

Firstly, the shape of Alice’s right palm is as follow:
这里是引用

And the shape of Alice’s left palm is symmetrical to her right palm.

In this puzzle, Alice will give the challenger many handprints of her
palm. The challenger must correctly tell Alice each handprint is her
left palm or right palm. Notice that the handprint of Alice’s palm is
given by its 2D plane coordinates in clockwise or counterclockwise
order. And The shape may be rotated and translated. But the shape
won’t be zoomed in nor be zoomed out.

Although you are not a robot, you are interested in solving puzzles.
Please try to solve this puzzle. 输入描述: The first line contains one
integer t (1 \le t \le 10^31≤t≤10 3 ) — the number of handprints
in Alice’s puzzle.

Each handprint is described by a simple polygon composed of 20 points.
Each point in this polygon will be given in clockwise or
counterclockwise order. Each line contains two real numbers with
exactly six digits after the decimal point, representing the
coordinate of a point. So a handprint is composed of 20 lines in the
input.

All values of coordinate in the input is in the range [-1000.0000000,
1000.000000]. 输出描述: For each footprint of palm, print a line contains “right” or “left”, indicating the footprint is the right palm or the
left palm respectively. 示例1 输入 复制 2
1.000000 0.000000
10.000000 0.000000
10.000000 8.000000
9.000000 8.000000
9.000000 5.000000
8.000000 5.000000
8.000000 10.000000
7.000000 10.000000
7.000000 5.000000
6.000000 5.000000
6.000000 10.000000
5.000000 10.000000
5.000000 5.000000
4.000000 5.000000
4.000000 10.000000
3.000000 10.000000
3.000000 3.000000
2.000000 3.000000
2.000000 6.000000
1.000000 6.000000
-1.000123 0.000000
-10.000123 0.000000
-10.000123 8.000000
-9.000123 8.000000
-9.000123 5.000000
-8.000123 5.000000
-8.000123 10.000000
-7.000123 10.000000
-7.000123 5.000000
-6.000123 5.000000
-6.000123 10.000000
-5.000123 10.000000
-5.000123 5.000000
-4.000123 5.000000
-4.000123 10.000000
-3.000123 10.000000
-3.000123 3.000000
-2.000123 3.000000
-2.000123 6.000000
-1.000123 6.000000
输出 复制 right left 示例2 输入 复制 1
19.471068 -6.709056
13.814214 -1.052201
13.107107 -1.759308
15.228427 -3.880629
14.521320 -4.587735
10.985786 -1.052201
10.278680 -1.759308
13.814214 -5.294842
13.107107 -6.001949
9.571573 -2.466415
8.864466 -3.173522
12.400000 -6.709056
11.692893 -7.416162
8.157359 -3.880629
7.450253 -4.587735
12.400000 -9.537483
11.692893 -10.244590
9.571573 -8.123269
8.864466 -8.830376
13.107107 -13.073017
输出 复制 right 说明 The handprint of example 2 is as follows:
> It obviously is the right palm.

看到题的一瞬间是懵的，画了一下图发现题目给好了顺逆时针，看顺逆时针以顺时针为例，边长先698是right，否则是left，看了题解，发现还有个精度问题开始写的1e-6过不了，改成1e-5就过了，可能精度不对吧。

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
struct node{
double x,y;
}value[30];
int t;
double dis(node a,node b)
{
    double dx=(a.x-b.x);
    double dy=(a.y-b.y);
    return sqrt(dx*dx+dy*dy);
}

double cj(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-b.x);
}

int main()
{
    cin>>t;
    while(t--)
    {
        bool flag=0;
        for(int i=0;i<20;i++)
        scanf("%lf%lf",&value[i].x,&value[i].y);
        for(int i=0;i<20;i++)
        {
            if(fabs(dis(value[i],value[(i+1)%20])-9)<1e-5)
            {
                node a=value[i],b=value[(i+1)%20],c=value[(i+2)%20];
                if((cj(a,b,c)>0&&fabs(dis(b,c)-6)<1e-5)||(cj(a,b,c)<0&&fabs(dis(b,c)-8)<1e-5))flag=1;
                break;
            }
        }
        if(flag)printf("left\n");
        else printf("right\n");
    }
    return 0;
}