Submission #3027482

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()

bool check(vector<int> vi, int n) {
    queue<int> q;
    q.push(vi[0]);
    FOR(i, 1, vi.size()) {
        int size = q.size();
        REP(j, size) {
            int n = q.front(); q.pop();
            q.push(n + vi[i]);
            q.push(n - vi[i]);
        }
    }
    bool ok = false;
    while (!q.empty()) {
        ok |= q.front() == n;
        q.pop();
    }
    return ok;
}

int main() {
    string s;
    int x, y;
    cin >> s >> x >> y;

    s += 'T';
    vector<int> hv, vv;
    int count = 0;
    bool horizontal = true;
    REP(i, s.length()) {
        if (s[i] == 'T') {
            if (horizontal) hv.push_back(count);
            else vv.push_back(count);
            horizontal = !horizontal;
            count = 0;
        }
        else count++;
    }

    bool ok = false;
    if (check(hv, x)){
        ok |= check(vv, y);
        vv[0] *= -1;
        ok |= check(vv, y);
    }
    if (ok) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result