poj 1654 Area （多边形求面积）

链接：http://poj.org/problem?id=1654

Area

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14952		Accepted: 4189

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

-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

又看了题解才A掉，记得自己曾对别人说WA不要马上看题解，一道题做两三天很正常，自己却MLE马上看题解

自己定的规则自己都不遵守

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>
 #include <iostream>
 #include <algorithm>
 #include <math.h>

 #define MAXX 1000002
 #define eps 1e-6
 typedef struct
 {
     double x;
     double y;
 } point;

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

 bool dy(double x,double y)
 {
     return x>y+eps;
 }
 bool xy(double x,double y)
 {
     return x<y-eps;
 }
 bool dd(double x,double y)
 {
     return fabs(x-y)<eps;
 }

 int main()
 {
     int n,m,i,j,x,y;
     scanf("%d",&n);
     char str[MAXX];
     int move[][]= {{,},{-,-},{,-},{,-},{-,},{,},{,},{-,},{,},{,}};
     for(i=; i<n; i++)
     {
         scanf("%s",str);
         int len=strlen(str);
         int x1=,y1=,x2,y2;
         long long ans=;
         for(j=; j<len-; j++)
         {
             x2=x1+move[str[j]-''][];
             y2=y1+move[str[j]-''][];
             ans+=((x1*y2)-(x2*y1));
             x1=x2;
             y1=y2;
         }
         ans = ans >  ? ans : (-)*ans;
         if(ans == )
             printf("0\n");
             else if(ans %  == )
             printf("%lld\n",ans/);
             else if(ans %  != )
             printf("%lld.5\n",ans/);
     }
 return ;
 }