Submission #2851697

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<queue>

using namespace std;

string s;
int x[2];
int p[2];
int v[2][10000];

int main(){
  cin>>s;
  s += 'E';
  cin>>x[0]>>x[1];
  int len = (int)s.length();


  int pp = 0;
  while(s[pp] == 'F') {
    x[0]--;
    pp++;
  }

  int d = 0;
  for(int i=pp;i<len;i++){
    if(s[i] == 'T'){
      d ^= 1;
    } else if(s[i] == 'F'){
      int tmp = 0;
      while(s[i] == 'F') {
        tmp++;
        i++;
      }
      i--;
      v[d][p[d]] = tmp;
      p[d]++;
    }
  }

  bool ans = true;

  for(int i=0;i<2;i++){
    int ma = 0;
    for(int j=0;j<p[i];j++)ma += v[i][j];

    int frip = 0;
    bool cango[2][40010];
    for(int j=0;j<40010;j++)for(int k=0;k<2;k++) cango[k][i] = false;
    int mid = 20005;
    cango[0][mid] = true;

    for(int k=0;k<p[i];k++){
      frip ^= 1;
      for(int j= -ma;j<=ma;j++){
        if(cango[frip^1][j+mid-v[i][k]] || cango[frip^1][j+mid+v[i][k]]) cango[frip][j+mid] = true;
        else cango[frip][j+mid] = false;
      }
      //for(int j= -ma;j<=ma;j++)cout<<cango[frip][j+mid]<<" ";cout<<endl;
    }

    if(!cango[frip][x[i]+mid]) ans = false;

  }

  if(ans){
    cout<<"Yes"<<endl;
  } else {
    cout<<"No"<<endl;
  }

  return 0;
}

Submission Info

Judge Result