POJ 1654 Area 求多边形的面积

最新推荐文章于 2020-10-17 19:41:07 发布

蘑菇小哲

最新推荐文章于 2020-10-17 19:41:07 发布

阅读量540

点赞数

分类专栏：计算几何

本文链接：https://blog.csdn.net/moguxiaozhe/article/details/44594455

版权

计算几何专栏收录该内容

10 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#define LL long long
using namespace std;
const int MAXN = 1000000 + 10;
int dir[10][2]={{0,0},{-1,-1},{0,-1},{1,-1},{-1,0},{0,0},{1,0},{-1,1},{0,1},{1,1}};
char s[MAXN];
struct Point
{
    LL x, y;
    Point(LL x = 0, LL y = 0) : x (x), y(y) { }
};
LL Cross(Point A, Point B)
{
    return A.x * B.y - A.y * B.x;
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%s", s);
        LL area = 0;
        Point P0, P1;
        P0.x = P0.y = 0;
        int len = strlen(s);
        for(int i=0;i<len;i++)
        {
            int x = s[i] - '0';
            P1.x = P0.x + dir[x][0];
            P1.y = P0.y + dir[x][1];
            area += Cross(P0, P1);
            P0 = P1;
        }
        if(area < 0) area *= -1;
        if(area % 2 == 0) printf("%I64d\n", area/2);
        else printf("%I64d.5\n", area/2);
    }
    return 0;
}