Submission #5496820

---

Source Code Expand

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0)
#define so sizeof
#define pb push_back
#define cl clear() ;
#define vl vector<ll>
#define sz size()
#define len length()
#define el endl;cout.flush()
#define be begin()
#define fi first
#define se second
#define br break
#define en end()
#define ro return 0
#define br break
#define eb emplace_back
#define con continue
#define ms(x) memset(x , 0, so x)
#define all(x) (x).be , (x).en
#define rall(x) (x).rbegin() , (x).rend()
#define acc(x) accumulate((x).be , (x).en , 0ll)
#define forn(i,a,b) for(ll i=a;i<=b;++i)
#define rng_58 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define vll vector<pair<ll,ll> >
#define pll pair<ll,ll>
#define plll pair<ll,pair<ll,ll>>
#define plvl pair<pair<ll,ll> ,ll>
#define mp make_pair
#define trace2(a,b) cerr <<"a is " << a << " b is " << b << el;
#define trace3(a,b,c) cerr <<"a is " << a << " b is " << b << " c is " << c << el;
#define trace4(a,b,c,d) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << el ;
#define trace5(a,b,c,d,e) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << el;
#define trace6(a,b,c,d,e,f) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << " f is " << f << el ;
int main()
{
    ios;
    string s ;
    cin >> s ;
    ll x , y ;
    cin >> x >> y ;
    vl vx , vy ;
    ll cnt = 0 ;
    ll cntt= 0 ;
    forn(i , 0 , s.len - 1 ){
         if(s[i] == 'T'){
            if(cntt % 2 == 1) {
                vy.pb(cnt) ;
            }
            else if(cntt % 2 == 0){
                vx.pb(cnt) ;
            }
            cnt = 0 ;
            ++cntt;
         }
         else {
            ++cnt ;
         }
    }
    if(cnt != 0 ) {
        if(cntt % 2 == 1) {
            vy.pb(cnt) ;
        }
        else if(cntt % 2 == 0 ) {
            vx.pb(cnt) ;
        }
        cnt = 0 ;
    }
    bool xdp[vx.sz + 5][16005] ;
    ms(xdp) ;
    bool ydp[vy.sz + 5][16005];
    ms(ydp) ;
    /// for x axis
    xdp[0][8000] = 1 ;
    forn(i , 1 , vx.sz){
       ll dist = vx[i-1] ;
       forn(j , 0 , 16000){
          if(i == 1){
            xdp[i][8000+dist] = 1 ;
            con ;
          }
          if(j - dist >=0){
            xdp[i][j] |= xdp[i-1][j-dist] ;
          }
          if( j +dist <=16000){
            xdp[i][j] |= xdp[i-1][j+dist];
          }
       }
    }
    /// for y axis
    ydp[0][8000] = 1 ;
    forn(i , 1 , vy.sz){
       ll dist = vy[i-1] ;
       forn(j , 0 , 16000){
          if( j - dist >= 0 ) {
             ydp[i][j] |= ydp[i-1][j-dist] ;
          }
          if (j+dist <= 16000){
             ydp[i][j] |= ydp[i-1][j+dist] ;
          }
       }
    }
    ll xx= 0 , yy = 0 ;
    xx = xdp[vx.sz][x+8000];
    yy = ydp[vy.sz][y+8000] ;
    if(xx == 1 and yy == 1) {
        cout << "Yes\n" ;
        ro ;
    }
    else {
        cout << "No\n" ;
        ro ;
    }
    ro ;
}

Submission Info

Judge Result