zoukankan      html  css  js  c++  java
  • Codeforces 626 A. Robot Sequence (8VC Venture Cup 2016-Elimination Round)

     
     
    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 main(){
        char a[250];
        int t,m,n,h,l,ans;
        while(~scanf("%d",&t)){
            scanf("%s",&a);
            ans=0;
            for(int i=0;i<t;i++){
                m=0;n=0;h=0;l=0;
             for(int j=i;j<t;j++){
                if(a[j]=='U') m++;
                if(a[j]=='D') n++;
                if(a[j]=='L') h++;
                if(a[j]=='R') l++;
                if(m==n&&h==l) ans++;
             }
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    背包问题
    阶乘尾数0的个数
    欧拉筛找素数
    威佐夫博弈
    三角形面积
    deleted
    deleted
    deleted
    deleted
    deleted
  • 原文地址:https://www.cnblogs.com/ZERO-/p/7107332.html
Copyright © 2011-2022 走看看