Problem:
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 F and T.

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:

s
x y

Output

If the objective is achievable, print Yes; if it is not, print No.

Sample Input 1

FTFFTFFF
4 2

Sample Output 1

Yes

The objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.

Sample Input 2

FTFFTFFF
-2 -2

Sample Output 2

Yes

The objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.

Sample Input 3

FF
1 0

Sample Output 3

No

Sample Input 4

TF
1 0

Sample Output 4

No

Sample Input 5

FFTTFF
0 0

Sample Output 5

Yes

The objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.

Sample Input 6

TTTT
1 0

Sample Output 6

No

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
	static void Main()
	{
		string s = Console.ReadLine();
    string[] input = Console.ReadLine().Split(' ');//Splitで区切り文字を指定して複数個受け取る。
		long x = long.Parse(input[0]);
		long y = long.Parse(input[1]);
    long[,] dpx = new long[2,16001];//可能な到達地点+8000。0を保存、1で更新する
    long[,] dpy = new long[2,16001];
    bool answer = false;
    long memoForward = 0;
    long turnCount = 0;

    for(long i = 0; i < s.Length; i++)
    {
      if(s[(int)i] == 'F') memoForward++;
      if(s[(int)i] == 'T' || i == s.Length-1)
      {
        if(turnCount == 0)
        {
          dpx[0,memoForward+8000] = 1;
        }else if(turnCount == 1)
        {
          dpy[0,memoForward+8000] = 1;
          dpy[0,-memoForward+8000] = 1;
        }else if(turnCount % 2 == 0)
        {
          for(long j = 0; j < 16001; j++)
          {
            if(dpx[0,j] == 1)
            {
              dpx[1,j-memoForward] = 1;
              dpx[1,j+memoForward] = 1;
            }
          }
        }else if(turnCount % 2 == 1)
        {
          for(long j = 0; j < 16001; j++)
          {
            if(dpy[0,j] == 1)
            {
              dpy[1,j-memoForward] = 1;
              dpy[1,j+memoForward] = 1;
            }
          }
        }
        turnCount++;
        memoForward = 0;
        if(turnCount >= 3)
        {
          for(long j = 0; j < 16001; j++)
          {
            dpx[0,j] = dpx[1,j];
            dpy[0,j] = dpy[1,j];
            dpx[1,j] = 0;
            dpy[1,j] = 0;
          }
        }
      }
    }
    
    if(turnCount >= 2) Console.WriteLine((dpx[0,x+8000] == 1 && dpy[0,y+8000] == 1) ? "Yes" : "No");
    else Console.WriteLine((s.Length == x && y == 0) ? "Yes" : "No");
    
	}
}