Area
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 4 5 825 6725 6244865 Sample Output 0 0 0.5 2 Source |
题目:http://poj.org/problem?id=1654
题意:描述一个多边形的走向,要求这个多边形的面积
分析:按照它描述的走向,求出所有点,对于相邻的点,用叉积求多边形的公式来做就可以了,这题要用到long long
代码:
#include<cstdio>
#include<iostream>
using namespace std;
int dx[9]={-1,0,1,-1,0,1,-1,0,1};
int dy[9]={-1,-1,-1,0,0,0,1,1,1};
char s[1111111];
int main()
{
int i,n,t;
long long x1,y1,x2,y2,ans;
scanf("%d",&t);
while(t--)
{
scanf("%s",s);
ans=x1=y1=0;
for(i=0,n=1;s[i]!='5';++i)
{
x2=x1+dx[s[i]-'1'];
y2=y1+dy[s[i]-'1'];
ans+=x1*y2-y1*x2;
x1=x2,y1=y2;
}
ans=ans<0?-ans:ans;
if(ans&1)printf("%lld.5\n",ans/2);
else printf("%lld\n",ans/2);
}
return 0;
}