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: Wrong Answer)

extern crate core;

use std::io::{self, Read};

#[macro_export]
macro_rules! input {
  ($s:expr=>$($t:tt)*) => {
    let mut lines=$s.split("\n");
    $(
        line_parse!(lines,$t);
    )*
  };
}

macro_rules! line_parse {
  ($lines:expr,($($name:ident:$t:tt)*)) => {
    let mut line=$lines.next().unwrap().split_whitespace();
    $(value_def!(line,$name,$t);)*
  };

  //複数行
  ($lines:expr,{$n:expr;$name:ident:$t:tt}) => {
    values_def!($lines,$n,$name,$t);
  };
}

macro_rules! value_def {
    ($line:expr, $name:ident, $t:tt) => {
        let $name = value!($line, $t);
    };
}

macro_rules! values_def {
    ($lines:expr, $n:expr, $name:ident, $t:tt) => {
        let $name = {
            let mut vec = Vec::new();
            for i in 0..$n {
                let mut next = $lines.next().unwrap().split_whitespace();
                vec.push(value!(next, $t));
            }
            vec
        };
    };
}

macro_rules! value {
  //配列
  ($line:expr,[$t:tt]) => {
    $line.map(|x|{
      let mut iter=::std::iter::once(x);
      value!(iter,$t)
    }).collect::<Vec<_>>()
  };
  //タプル
  ($line:expr,($($t:tt),*)) => {
    ($(value!($line,$t),)*)
  };
  //文字列
  ($line:expr,#) => {
    $line.next().unwrap()
  };
  //単一値
  ($line:expr,$t:ty) => {
    $line.next().unwrap().parse::<$t>().unwrap()
  };
  //インデックス(-1)
  ($line:expr,@) => {
    $line.next().unwrap().parse::<usize>().unwrap()-1
  };
}

fn main() {
    let mut input = String::new();
    io::stdin().read_to_string(&mut input).unwrap();
    let output = solve(input.trim().to_string());
    println!("{}", output);
}

#[derive(Clone, Copy, Debug)]
enum Cmd {
    F(i64),
    T(i64),
}

fn solve(input: String) -> String {
    input!(input=>(s:#)(target:(i64,i64)));
    let (xlist, ylist) = {
        let list = {
            let mut vec = Vec::new();
            let mut old = 'X';
            let mut count = 0;
            for x in s.chars() {
                if old == x {
                    count += 1;
                } else {
                    if count != 0 {
                        if old == 'F' {
                            vec.push(Cmd::F(count));
                        } else {
                            vec.push(Cmd::T(count));
                        }
                    }
                    count = 1;
                }
                old = x;
            }
            if count != 0 {
                if old == 'F' {
                    vec.push(Cmd::F(count));
                } else {
                    vec.push(Cmd::T(count));
                }
            }
            vec
        };

        let mut xlist = Vec::new();
        let mut ylist = Vec::new();
        let mut is_x = true;

        for x in list {
            if let Cmd::F(x) = x {
                if is_x {
                    xlist.push(x);
                } else {
                    ylist.push(x);
                }
            } else if let Cmd::T(x) = x {
                if x % 2 == 1 {
                    is_x = !is_x;
                }
            }
        }
        (xlist, ylist)
    };

    let size = std::cmp::max(xlist.len(), ylist.len());
    let mut dp = Vec::with_capacity(size);
    dp.resize(size, {
        let mut v = Vec::with_capacity(16000);
        v.resize(16000, None);
        v
    });

    let xb = f(&xlist, target.0, 0, 0, &mut dp.clone());
    let yb = f(&ylist, target.1, 0, 0, &mut dp);

    if xb && yb { "Yes" } else { "No" }.to_string()
}

fn f(list: &Vec<i64>, target: i64, i: usize, point: i64, dp: &mut Vec<Vec<Option<bool>>>) -> bool {
    if list.len() == i {
        target == point
    } else if let Some(b) = dp[i][(point + 8000) as usize] {
        b
    } else {
        let b = f(list, target, i + 1, point + list[i], dp)
            || f(list, target, i + 1, point - list[i], dp);
        dp[i][(point + 8000) as usize] = Some(b);
        b
    }
}

macro_rules! tests {
    ($($name:ident: $input:expr=>$output:expr,)*) => {
        mod tests {
            $(
                #[test]
                fn $name() {
                    assert_eq!($output.trim().to_string(),super::solve($input.trim().to_string()));
                }
            )*
        }
    }
}

tests! {
    test1: "FTFFTFFF\n4 2" => "Yes",
    test2: "FTFFTFFF\n-2 -2" => "Yes",
    test3: "FF\n1 0" => "No",
    test4: "TF\n1 0" => "No",
    test5: "FFTTFF\n0 0" => "Yes",
    test6: "TTTT\n1 0" => "No",
}