Submission #2852853

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <functional>
#include <string>
#include <stack>
#include <set>
#include <sstream>
#include <iomanip>
#include <limits>
#include <cstring>

using namespace std;
using ll = long long;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<string, string> sP;
typedef pair<ll, pair<ll, ll>> PP;

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1 << 30;
const ll INF2 = 9e18;
const double INF3 = 9e14;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int px[6] = { 0,1,-1,1,0,1 }, py[6] = { -1,-1,0,0,1,1 };
const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 };
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second

bool dpx[32000][8010], dpy[32000][8010];

int main() {
	string s;
	int x, y, now = 16000, fl = 2;
	cin >> s >> x >> y;
	dpx[16000][0] = true, dpy[16000][0] = true;
	x += 16000, y += 16000;
	for (int i = 0;i < s.size();i++) {
		if (fl == 2 && s[i] == 'F') {
			dpx[now + 1][i+1] = true;
			dpy[16000][i+1] = true;
			now++;
		}
		else if (fl == 2 && s[i] == 'T') {
			fl = 1;
			dpx[now][i+1] = true;
			dpy[16000][i+1] = true;
		}
		else if (fl == 1 && s[i] == 'F') {
			for (int j = 8000;j <= 24000;j++) {
				if (dpy[j][i])dpy[j + 1][i+1] = true, dpy[j - 1][i+1] = true;
			}
			for (int j = 8000;j <= 24000;j++) {
				if (dpx[j][i])dpx[j][i+1] = true;
			}
		}
		else if (fl == 1 && s[i] == 'T') {
			fl = 0;
			for (int j = 8000;j <= 24000;j++) {
				if (dpy[j][i])dpy[j][i+1] = true;
			}
			for (int j = 8000;j <= 24000;j++) {
				if (dpx[j][i])dpx[j][i+1] = true;
			}
		}
		else if (fl == 0 && s[i] == 'F') {
			for (int j = 8000;j <= 24000;j++) {
				if (dpx[j][i])dpx[j + 1][i+1] = true, dpx[j - 1][i+1] = true;
			}
			for (int j = 8000;j <= 24000;j++) {
				if (dpy[j][i])dpy[j][i+1] = true;
			}
		}
		else if (fl == 0 && s[i] == 'T') {
			fl = 1;
			for (int j = 8000;j <= 24000;j++) {
				if (dpx[j][i])dpx[j][i+1] = true;
			}
			for (int j = 8000;j <= 24000;j++) {
				if (dpy[j][i])dpy[j][i+1] = true;
			}
		}
	}
	if (dpx[x][(int)s.size()] && dpy[y][(int)s.size()])cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}

Submission Info

Judge Result