zoukankan      html  css  js  c++  java
  • POJ 1654 Area

    Time Limit: 1000MS   Memory Limit: 10000K
    Total 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: 

    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

     

    #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
    ");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
    ",area/2);
            else printf("%d.5
    ",area/2);
        }
        return 0; 
    }
    

      

  • 相关阅读:
    1 step / 2 step STO
    关于Shipping
    Retail Article Master Data 学习 (四) Assortment
    SAP Basis 性能分析 记忆点
    从数据库中读取二进制数据,并显示图片
    [转]c#金山词霸组件法
    C# 处理INI文个类 INIManager
    C#实现通过HttpWebRequest发送POST请求实现网站自动登陆
    XPath语法参考
    关于IE6和IE7关闭窗口时提示和不提示以及上传图片前的本地预览解决办法
  • 原文地址:https://www.cnblogs.com/guohaoyu110/p/6351542.html
Copyright © 2011-2022 走看看