Submission #1879734

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define int long long

string S;
int X, Y;
bool dp[2][200001];

signed main() {
	vector<int> v;
	cin >> S >> X >> Y;
	S += 'T';
	reverse(S.begin(), S.end());
	v.push_back(0);
	while (!S.empty()) {
		if (S.back() == 'F') v.back()++;
		else v.push_back(0);
		S.pop_back();
	}
	X -= v.front();
	v.erase(v.begin());
	vector<int> v1, v2;
	for (int i = 0; i < v.size(); i += 2) v1.push_back(v[i]);
	for (int i = 1; i < v.size(); i += 2) v2.push_back(v[i]);
	auto f = [&](int x, const vector<int> &w) {
		const int O = 100000;
		for (int i = -90000; i <= 90000; i++) dp[0][O + i] = dp[1][O + i] = false;
		dp[0][O + 0] = true;
		for (int i = 0; i < w.size(); i++) {
			for (int j = -90000; j <= 90000; j++) {
				if (!dp[i&1][O + j]) continue;
				dp[(i + 1)&1][O + j + w[i]] = true;
				dp[(i + 1)&1][O + j - w[i]] = true;
			}
			for (int j = -90000; j <= 90000; j++) {
				dp[i&1][O + j] = false;
			}
		}
		return dp[w.size()&1][O + x];
	};
	if (f(Y, v1) && f(X, v2)) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}

Submission Info

Judge Result