Area

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 17456		Accepted: 4847

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:

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.

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

4

5

825

6725

6244865

0

0

0.5

2

 #include<cstdio>

 #include<cstring>

 using namespace std;

 typedef long long LL;

 const int dx[]={,,,,,,-,-,-};

 const int dy[]={-,,,-,,,-,,};

 LL ans;

 char s[];

 int main() {

     int T;

     scanf("%d",&T);

     while(T--) {

         ans=;

         scanf("%s",s);

         int nx=,ny=,x,y;

         int l=strlen(s);

         for(int i=;i<l;i++) {        //为啥直接写strlen(s)会TLE =-=

             x=nx+dx[s[i]-''];

             y=ny+dy[s[i]-''];

             ans += (x*ny-nx*y);

             nx=x , ny=y;

         }

         if(ans<) ans=-ans;

         printf("%lld",ans/);

         if(ans&) printf(".5");

         putchar('\n');

     }

     return ;

 }