POJ 1654 Area
来源:互联网 发布:程序员一般工资多少 编辑:程序博客网 时间:2024/05/22 08:05
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
- 微信小程序的报价预算
- leecode 解题总结:18 4Sum
- php magic_quotes_gc选项
- ERROR:格式化hdfs时出现connection-refused
- poj 3176 Cow Bowling
- POJ 1654 Area
- android_107_ProgressBar旋转
- CCF201609-2 火车购票(100分)
- OpenStack基础之stevedore
- POJ3592 Instantaneous Transference题解
- POJ 2386 Lake Counting (DFS)
- Postgres安装指南-windows10-flask-py3
- MYSQL问题解决方案:Access denied for user 'root'@'localhost' (using password:YES)
- 比大小