zoukankan      html  css  js  c++  java
  • A. Robot Sequence

    A. Robot Sequence
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Calvin the robot lies in an infinite rectangular grid. Calvin's source code contains a list of n commands, each either 'U', 'R', 'D', or 'L' — instructions to move a single square up, right, down, or left, respectively. How many ways can Calvin execute a non-empty contiguous substrings of commands and return to the same square he starts in? Two substrings are considered different if they have different starting or ending indices.

    Input

    The first line of the input contains a single positive integer, n (1 ≤ n ≤ 200) — the number of commands.

    The next line contains n characters, each either 'U', 'R', 'D', or 'L' — Calvin's source code.

    Output

    Print a single integer — the number of contiguous substrings that Calvin can execute and return to his starting square.

    Examples
    input
    6
    URLLDR
    output
    2
    input
    4
    DLUU
    output
    0
    input
    7
    RLRLRLR
    output
    12
    Note

    In the first case, the entire source code works, as well as the "RL" substring in the second and third characters.

    Note that, in the third case, the substring "LR" appears three times, and is therefore counted three times to the total result.

    #include<bits/stdc++.h>
    using namespace std;
    int ud[202];
    int rl[202];
    int main()
    {
        int n;
        char a;
    
        scanf("%d",&n);getchar();
        for(int i=0;i<n;i++)
        {
            scanf("%c",&a);
            if(a=='U') ud[i]=1;
            else if(a=='D') ud[i]=-1;
            else if(a=='R') rl[i]=1;
            else rl[i]=-1;
    
        }
        int ans=0;
        int cntud=0;
        int cntrl=0;
        for(int i=0;i<n;i++)
        {
            cntud=ud[i];
            cntrl=rl[i];
            for(int j=i+1;j<n;j++)
            {
    
               cntud+=ud[j];
               cntrl+=rl[j];
               if(cntud==0&&cntrl==0) ans++;
            }
        }
        printf("%d
    ",ans);
        return 0;
    }
    

      

  • 相关阅读:
    JSON序列化选项
    JOSN的stringify()和parse()方法
    html5增强元素--续
    html5页面增强元素
    js继承模式
    js常用设计模式
    js跨浏览器事件处理
    前端兴趣浓厚,后端提不起来兴趣
    padding的讲究
    margin的讲究
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5188756.html
Copyright © 2011-2022 走看看