计算几何 POJ 1654 Area

最新推荐文章于 2024-09-20 15:09:03 发布

Frank（Zhiyang-Dou）

最新推荐文章于 2024-09-20 15:09:03 发布

阅读量244

点赞数

分类专栏：计算几何文章标签：计算几何算法 OJ 解题报告

本文链接：https://blog.csdn.net/OOFFrankDura/article/details/104791481

版权

计算几何专栏收录该内容

14 篇文章 1 订阅

订阅专栏

Problem

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

思路

叉乘计算面积
使用数组维护位置变换信息
注意最后的正负
最后的结果不是整数就是整数加0.5（一个方块是1，半个方块是0.5）

代码

#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
const int MAXN = 1000010;
const double EPS = 1e-8;
int dx[10] = { 0,-1,0,1,-1,0,1,-1,0,1 };    //记录每种操作走的方向
int dy[10] = { 0,-1,-1,-1,0,0,0,1,1,1 };
int sgn(double x) {
	if (fabs(x) < EPS) return 0;
	return x < 0 ? -1 : 1;
}
struct Point {
	int x, y;
	Point() {}
	Point(int  _x, int _y) {
		x = _x;
		y = _y;
	}
	Point operator-(const Point &b) const {
		return Point(x - b.x, y - b.y);
	}
	int operator *(const Point &b)const {
		return x * b.x + y * b.y;
	}
	int operator ^(const Point &b)const {
		return x * b.y - y * b.x;
	}
};

int cross(Point p0, Point p1, Point p2) {
	return (p1 - p0) ^ (p2 - p0);
}

char str[MAXN];
int main()
{
	ll ans;
	int T;
	scanf("%d", &T);
	Point p1, p2;
	Point p;//原点 
	p.x = p.y = 0;
	while (T--)
	{
		p1.x = 0;
		p1.y = 0;
		ans = 0;
		scanf("%s", str);
		int len = strlen(str);
		for (int i = 0; i < len - 1; i++)
		{
			p2.x = p1.x + dx[str[i] - '0'];  //利用string得到真正的步长
			p2.y = p1.y + dy[str[i] - '0'];

			ans += cross(p, p1, p2);

			p1.x = p2.x;//更新上一步的坐标 
			p1.y = p2.y;
		}
		//ans = fabs(ans);  long long 使用fabs不行
		if (ans < 0) {
			ans = -ans;
		}
		//注意最后的结果不是整数就是整数加0.5
		if (ans % 2 == 0)    printf("%lld\n", ans / 2);
		else printf("%lld.5\n", (ans - 1) / 2);
	}
	return 0;
}