D - FT Robot
当前没有测试数据。
D - FT Robot
Score : $500$ points
Problem Statement
A robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive $x$-axis direction.
This robot will be given an instruction sequence $s$. $s$ consists of the following two kinds of letters, and will be executed in order from front to back.
F: Move in the current direction by distance $1$.T: Turn $90$ degrees, either clockwise or counterclockwise.
The objective of the robot is to be at coordinates $(x, y)$ after all the instructions are executed. Determine whether this objective is achievable.
Constraints
- $s$ consists of
FandT. - $1 \leq |s| \leq 8$ $000$
- $x$ and $y$ are integers.
- $|x|, |y| \leq |s|$
Input
Input is given from Standard Input in the following format:
Output
If the objective is achievable, print Yes; if it is not, print No.
FTFFTFFF
4 2
Yes
The objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.
FTFFTFFF
-2 -2
Yes
The objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.
FF
1 0
No
TF
1 0
No
FFTTFF
0 0
Yes
The objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.
TTTT
1 0
No