A10210 | Robot Sequence
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
输入格式
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.
The next line contains $n$ characters, each either 'U', 'R', 'D', or 'L' — Calvin's source code.
输出格式
Print a single integer — the number of contiguous substrings that Calvin can execute and return to his starting square.
输入输出样例
输入 #1
6 URLLDR
输出 #1
2
输入 #2
4 DLUU
输出 #2
0
输入 #3
7 RLRLRLR
输出 #3
12
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.
Note that, in the third case, the substring "LR" appears three times, and is therefore counted three times to the total result.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted