Following Directions

Pretty Boy Fox

于 2024-10-30 09:15:00 发布

阅读量898

点赞数 11

CC 4.0 BY-SA版权

文章标签： c++

本文链接：https://blog.csdn.net/2301_80065123/article/details/143223661

B. Following Directions

Problem

Alperen is standing at the point $(0, 0)$ . He is given a string $s$ of length $n$ and performs $n$ moves. The $i$ -th move is as follows:

if $si=Ls_i = \texttt{L}$ , then move one unit left;
if $si=Rs_i = \texttt{R}$ , then move one unit right;
if $si=Us_i = \texttt{U}$ , then move one unit up;
if $si=Ds_i = \texttt{D}$ , then move one unit down.

在这里插入图片描述

There is a candy at $(1, 1)$ (that is, one unit above and one unit to the right of Alperen’s starting point). You need to determine if Alperen ever passes the candy.

Alperen’s path in the first test case.

Input

The first line of the input contains an integer $t$ ( $\leq t \leq 1000$ ) — the number of testcases.

The first line of each test case contains an integer $n$ ( $\leq n \leq 50$ ) — the length of the string.

The second line of each test case contains a string $s$ of length $n$ consisting of characters $L\texttt{L}$ , $R\texttt{R}$ , $D\texttt{D}$ , and $U\texttt{U}$ , denoting the moves Alperen makes.

Output

For each test case, output “YES” (without quotes) if Alperen passes the candy, and “NO” (without quotes) otherwise.

You can output the answer in any case (for example, the strings “yEs”, “yes”, “Yes” and “YES” will be recognized as a positive answer).

Example

Input

7
7
UUURDDL
2
UR
8
RRRUUDDD
3
LLL
4
DUUR
5
RUDLL
11
LLLLDDRUDRD

Output

YES
YES
NO
NO
YES
YES
NO

Note

In the first test case, Alperen follows the path

$\overset{\texttt{U}}{\to} (0,1) \overset{\texttt{U}}{\to} (0,2) \overset{\texttt{U}}{\to} (0,3) \overset{\texttt{R}}{\to} (1,3) \overset{\texttt{D}}{\to} (1,2) \overset{\texttt{D}}{\to} \color{green}{\mathbf{(1,1)}} \overset{\texttt{L}}{\to} (0,1).$
Note that Alperen doesn’t need to end at the candy’s location of $(1, 1)$ , he just needs to pass it at some point.

In the second test case, Alperen follows the path

$\overset{\texttt{U}}{\to} (0,1) \overset{\texttt{R}}{\to} \color{green}{\mathbf{(1,1)}}.$

In the third test case, Alperen follows the path

$\overset{\texttt{R}}{\to} (1,0) \overset{\texttt{R}}{\to} (2,0) \overset{\texttt{R}}{\to} (3,0) \overset{\texttt{U}}{\to} (3,1) \overset{\texttt{U}}{\to} (3,2) \overset{\texttt{D}}{\to} (3,1) \overset{\texttt{D}}{\to} (3,0) \overset{\texttt{D}}{\to} (3,-1).$

In the fourth test case, Alperen follows the path

$\overset{\texttt{L}}{\to} (-1,0) \overset{\texttt{L}}{\to} (-2,0) \overset{\texttt{L}}{\to} (-3,0).$

Code

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

void solve()
{
    ll n;
    cin>>n;
    string s;
    cin>>s;

    ll x=0,y=0;
    for(auto &t:s)
    {
        if(t=='L') x--;
        if(t=='R') x++;
        if(t=='U') y++;
        if(t=='D') y--;
        if(x==1&&y==1)
        {
            cout<<"YES"<<endl;
            return;
        }
    }
    cout<<"NO"<<endl;
}

int main()
{
    ll t;
    cin>>t;

    while(t--) solve();
    
    return 0;
}