Problem p03490 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>

#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)

#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)

#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template <class T> bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}

using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

// Problem Specific Parameter:

vector<int> xmov;
vector<int> ymov;

const int limit = 20010;
const int offset = 10005;

bool dp[2][limit];

bool calc(vector<int> &mov, int tar) {
  const int n = mov.size();
  rep(i, 2) rep(j, limit) dp[i][j] = false;
  dp[0][offset] = true;

  rep(i, n) {
    rep(j, limit) {
      if (dp[0][j] == false)
        continue;
      if (j + mov[i] < limit)
        dp[1][j + mov[i]] = true;
      if (j - mov[i] >= 0)
        dp[1][j - mov[i]] = true;
    }
    rep(j, limit) {
      dp[0][j] = dp[1][j];
      dp[1][j] = false;
    }
  }

  return dp[0][tar + offset];
}

int main(void) {
  bool xdir = true, start = true;
  string s;
  cin >> s;
  s += "T";
  const int n = s.size();

  int sx = 0, sy = 0, cnt = 0;
  rep(i, n) {
    if (s[i] == 'F') {
      cnt++;
    } else {
      if (start) {
        sx = cnt;
      } else if (xdir) {
        xmov.push_back(cnt);
      } else {
        ymov.push_back(cnt);
      }
      xdir ^= true;
      cnt = 0;
      start = false;
    }
  }

  int gx, gy;
  cin >> gx >> gy;

  if (calc(xmov, gx - sx) and calc(ymov, gy - sy))
    puts("Yes");
  else
    puts("No");

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>

#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)

#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)

#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)
#define clr(a, b) memset((a), (b), sizeof(a))
#define bit(n) (1LL << (n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template <class T> bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}

using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }
inline R sq(R x) { return sqrt(max(x, 0.0L)); }

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

// Problem Specific Parameter:

vector<int> xmov;
vector<int> ymov;

const int limit = 32010;
const int offset = 16005;

bool dp[2][limit];

bool calc(vector<int> &mov, int tar) {
  const int n = mov.size();
  rep(i, 2) rep(j, limit) dp[i][j] = false;
  dp[0][offset] = true;

  rep(i, n) {
    rep(j, limit) {
      if (dp[0][j] == false)
        continue;
      if (j + mov[i] < limit)
        dp[1][j + mov[i]] = true;
      if (j - mov[i] >= 0)
        dp[1][j - mov[i]] = true;
    }
    rep(j, limit) {
      dp[0][j] = dp[1][j];
      dp[1][j] = false;
    }
  }

  return dp[0][tar + offset];
}

int main(void) {
  bool xdir = true, start = true;
  string s;
  cin >> s;
  s += "T";
  const int n = s.size();

  int sx = 0, sy = 0, cnt = 0;
  rep(i, n) {
    if (s[i] == 'F') {
      cnt++;
    } else {
      if (start) {
        sx = cnt;
      } else if (xdir) {
        xmov.push_back(cnt);
      } else {
        ymov.push_back(cnt);
      }
      xdir ^= true;
      cnt = 0;
      start = false;
    }
  }

  int gx, gy;
  cin >> gx >> gy;

  if (calc(xmov, gx - sx) and calc(ymov, gy - sy))
    puts("Yes");
  else
    puts("No");

  return 0;
}