D - Area解题报告

最新推荐文章于 2023-05-31 19:44:57 发布

原创最新推荐文章于 2023-05-31 19:44:57 发布 · 959 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#orthogonal #each #input #integer #64bit #go

计算几何专栏收录该内容

3 篇文章

订阅专栏

本文是关于D - Area问题的解题报告，重点探讨了在解决过程中遇到的精度挑战，强调了使用__int64类型来确保计算的准确性。通过示例输入和输出，展示了具体解题思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D - Area

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

You are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the following vertexes of the polygon until back to the initial vertex. For each step you may go North, West, South or East with step length of 1 unit, or go Northwest, Northeast, Southwest or Southeast with step length of square root of 2.

For example, this is a legal polygon to be computed and its area is 2.5:

Input

The first line of input is an integer t (1 <= t <= 20), the number of the test polygons. Each of the following lines contains a string composed of digits 1-9 describing how the polygon is formed by walking from the origin. Here 8, 2, 6 and 4 represent North, South, East and West, while 9, 7, 3 and 1 denote Northeast, Northwest, Southeast and Southwest respectively. Number 5 only appears at the end of the sequence indicating the stop of walking. You may assume that the input polygon is valid which means that the endpoint is always the start point and the sides of the polygon are not cross to each other.Each line may contain up to 1000000 digits.

Output

For each polygon, print its area on a single line.

Sample Input

Sample Output

这个题目主要是涉及到了精度的问题，只能用__int64;

代码1：

#include<iostream>
using namespace std;
__int64 move[10][2]={{0,0},{1,-1},{1,0},{1,1},{0,-1},{0,0},{0,1},{-1,-1},{-1,0},{-1,1}};
__int64 Getarea(__int64 x1,__int64 x2,__int64 y1,__int64 y2)
{
	return (x1*y2-x2*y1);
}
int main()
{
	int n,p;
	char c;
	__int64 x1=0,x2=0,y1,y2,area=0;
	cin>>n;
	while(n--)
	{
		while((c=cin.get())!='5')
		{
			p=c-'0';
			x2=x1+move[p][0];
			y2=y1+move[p][1];
			area+=Getarea(x1,x2,y1,y2);
			x1=x2;
			y1=y2;
		}
		if(area<0)
		{
			area=(-1)*area;
		}
		x2=area/2;
		if(area!=x2*2)
		{
			printf("%I64d.5\n",x2);
		}
		else
			printf("%I64d\n",x2);
		area=0;
	}
	return 0;
}

代码2：

#include<iostream>
using namespace std;
struct Point
{
    __int64 x;
    __int64 y;
};
int D[10][2]={{0,0},{-1,-1},{0,-1},{1,-1},{-1,0},{0,0},{1,0},{-1,1},{0,1},{1,1}};
//求面积
__int64 area(Point p1,Point p2)
{
    return p1.x*p2.y-p2.x*p1.y;
}
int t;
char ch[1000005];
int main()
{
    int i,j;
    int id;
    int len;
    __int64 Area=0;
    scanf("%d",&t);
    Point p0,p1;
    for(i=0;i<t;++i)
    {
        p0.x=0;
        p0.y=0;
        Area=0;
        scanf("%s",&ch);
        len=strlen(ch);
        for(j=0;j<len-1;++j)
        {
            id=ch[j]-'0';
            p1.x=p0.x+D[id][0];
            p1.y=p0.y+D[id][1];
            Area+=area(p1,p0);
            p0=p1;
        }
        if(Area<0)
            Area=-Area;
        __int64 res=Area/2;
        if(res*2 == Area)
            printf("%I64d\n",res);
        else
            printf("%I64d.5\n",res);
    }
    return 0;
}