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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include "bits/stdc++.h"
using namespace std;

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 1e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };

int main() {
	string s;
	cin >> s;
	int i, j, x, y;
	cin >> x >> y;
	vi tate, yoko;
	int dir = 0;
	int cnt = 0;
	for (i = 0; i < s.size(); i++) {
		if (s[i] == 'F') {
			cnt++;
		}
		else {
			if (dir == 0) {
				yoko.push_back(cnt);
			}
			else {
				tate.push_back(cnt);
			}
			cnt = 0;
			dir = 1 - dir;
		}
	}
	if (dir == 0) {
		yoko.push_back(cnt);
	}
	else {
		tate.push_back(cnt);
	}
	x -= yoko[0];
	if (x < -8050) {
		cout << "No" << endl;
		return 0;
	}
	yoko.erase(yoko.begin());
	
	DEBUG_VEC(yoko);
	DEBUG_VEC(tate);
	DEBUG(x);
	DEBUG(y);
	
	vector<vector<bool> > dpyoko(yoko.size()+1,vector<bool> (16100, false)), dptate(tate.size()+1,vector<bool>(16100, false));
	dpyoko[0][8050] = dptate[0][8050] = true;
	for (i = 0; i < yoko.size(); i++) {
		for (j = 0; j < 16100; j++) {
			if (dpyoko[i][j]) {
				dpyoko[i + 1][j + yoko[i]] = true;
				dpyoko[i + 1][j - yoko[i]] = true;
			}
		}
	}
	for (i = 0; i < tate.size(); i++) {
		for (j = 0; j < 16100; j++) {
			if (dptate[i][j]) {
				dptate[i + 1][j + tate[i]] = true;
				dptate[i + 1][j - tate[i]] = true;
			}
		}
	}
	if (dpyoko[yoko.size()][x + 8050] && dptate[tate.size()][y + 8050]) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}