626A.Robot Sequence

最新推荐文章于 2020-07-17 14:57:38 发布

原创最新推荐文章于 2020-07-17 14:57:38 发布 · 430 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

codeforces 专栏收录该内容

16 篇文章

订阅专栏

本文探讨了一个位于无限矩形网格中的机器人如何通过执行其源代码中的连续子串指令返回起点的问题。具体而言，机器人遵循一系列向上(U)、向下(D)、向左(L)和向右(R)的指令。文章提供了一段Python代码示例，该代码能够计算出所有能让机器人回到起点的有效子串数量。

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.

思路：求字符串中能使其回到原点的子串，包括其自身，利用暴力求解

[python]view plain copy 
           
 
 #!/usr/bin/python  
 # -*-coding:utf-8 -*-  
 from collections import Counter  
 n=int(raw_input())  
 commands=list(raw_input())  
 ans=0  
 for i in range(n):  
     for j in range(i+1,n+1):  
         c=Counter(commands[i:j])  
         if c['R']==c['L'] and c['U']==c['D']:  
             ans+=1  
 print ans  