POJ 1654 Area
来源:互联网 发布:找工作可靠的软件 编辑:程序博客网 时间:2024/06/07 06:26
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19635 Accepted: 5375
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:
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
4582567256244865
Sample Output
000.52
#include <stdio.h>#include <string.h>#include <math.h>int dx[10]={0,1,1,1,0,0,0,-1,-1,-1};int dy[10]={0,-1,0,1,-1,0,1,-1,0,1};char s[1000010];int area,x,y,px,py;int main(){ int t,tmp,i; scanf("%d",&tmp); while(tmp--){ scanf("%s",s); t=(int)strlen(s); if(t<3) {printf("0\n");continue;} area=0; x=y=0; for(i=0;i<t-1;i++){ px=x+dx[s[i]-'0']; py=y+dy[s[i]-'0']; area+=(px*y-x*py);//这个是看了别人的算法之后才写的,我还是没想明白为什么可以这样表示面积 x=px; y=py; } if(area<0) area=(-1)*area; if(area%2==0) printf("%d\n",area/2); else printf("%d.5\n",area/2); } return 0; }
0 0
- poj 1654 Area
- POJ 1654 Area
- POJ 1654 Area
- poj 1654 Area
- POJ 1654 Area
- poj 1654Area
- poj 1654 Area
- POJ 1654 Area
- POJ 1654 Area
- poj 1654 Area
- poj 1654 Area
- POJ 1654 Area
- POJ 1654 Area
- POJ 1654 Area
- poj 1654 Area
- POJ 题目1654Area
- poj 1654 Area
- poj 1654 Area
- 关于编程风格和文档的扩展指南
- 天猫淘宝登陆页面无限循环 解决办法
- PIL修改图片
- 脱壳-MoleBox(2.0.0-2.3.0)
- windows下使用VS编译libIconv库
- POJ 1654 Area
- PLSQL Package 3
- html5编辑器(图片编辑器基于canvas)
- NuSMV运行样例解析
- 如何利用多核CPU来加速你的Linux命令 — awk, sed, bzip2, grep, wc等
- ThinkPHP的钩子实现原理
- 求转置矩阵问题
- NuSmv安装与使用
- 简洁精美源于分析透彻,构思明确、求精,逻辑练达。(9)