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 Rust (1.15.1) (judge verdict: Accepted)

use std::cmp;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::io::Read;
use std::usize::MAX;

macro_rules! input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();let mut next = || { iter.next().unwrap() };input_inner!{next, $($r)*}};($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}
macro_rules! input_inner {($next:expr) => {};($next:expr, ) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}
macro_rules! read_value {($next:expr, ( $($t:tt),* )) => {( $(read_value!($next, $t)),* )};($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => {read_value!($next, usize) - 1};($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);(0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()}};($next:expr, $t:ty) => {$next().parse::<$t>().expect("Parse error")};}

fn solve() {
    input! {
        s: chars,
        x: i64,
        y: i64
    }

    let mut f_array: VecDeque<i64> = VecDeque::new();

    let mut count = 0;
    for c in s {
        if c == 'F' {
            count += 1;
        } else {
            f_array.push_back(count);
            count = 0;
        }
    }
    if count != 0 {
        f_array.push_back(count);
    }

    // 最初の移動
    let mut pos: (i64, i64) = (0, 0);
    let first = f_array.pop_front().unwrap();
    pos.0 += first;

    let mut x_array = Vec::new();
    let mut y_array = Vec::new();

    let mut now_x = false;

    for i in &f_array {
        if now_x {
            x_array.push(*i);
            now_x = false;
        } else {
            y_array.push(*i);
            now_x = true;
        }
    }

    let mut x_dp = vec![vec![false; 16000 + 1]; x_array.len() + 1];
    x_dp[0][8000 + pos.0 as usize] = true;

    let mut y_dp = vec![vec![false; 16000 + 1]; y_array.len() + 1];
    y_dp[0][8000] = true;

    for i in 1..x_array.len() + 1 {
        for j in 0..16000 {
            let plus = if j as i64 >= x_array[i - 1] {
                if x_dp[i - 1][(j - x_array[i - 1]) as usize] {
                    true
                } else {
                    false
                }
            } else {
                false
            };

            let minus = if j as i64 + x_array[i - 1] <= 16000 {
                if x_dp[i - 1][(j + x_array[i - 1]) as usize] {
                    true
                } else {
                    false
                }
            } else {
                false
            };

            if plus || minus {
                x_dp[i][j as usize] = true;
            }
        }
    }

    for i in 1..y_array.len() + 1 {
        for j in 0..16000 {
            let plus = if j as i64 >= y_array[i - 1] {
                if y_dp[i - 1][(j - y_array[i - 1]) as usize] {
                    true
                } else {
                    false
                }
            } else {
                false
            };

            let minus = if j as i64 + y_array[i - 1] <= 16000 {
                if y_dp[i - 1][(j + y_array[i - 1]) as usize] {
                    true
                } else {
                    false
                }
            } else {
                false
            };

            if plus || minus {
                y_dp[i][j as usize] = true;
            }
        }
    }

    if x_dp[x_array.len()][(x + 8000) as usize] && y_dp[y_array.len()][(y + 8000) as usize] {
        println!("Yes");
    } else {
        println!("No");
    }
}

fn main() {
    let thd = std::thread::Builder::new().stack_size(104_857_600);
    thd.spawn(|| solve()).unwrap().join().unwrap();

    /*
    // 入力を一括で読み込む場合
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();
    let mut input = buf.split_whitespace();

    // inputに対しnext()で読み込んでいく
    let q: usize = input.next().unwrap().parse().unwrap();
    */
}

const LARGE_PRIME: u64 = 1_000_000_007;

// @〜でsnippet