Submission #3435310

---

Source Code Expand

def search(keys,dic,now,sum_):
    if sum_ < 0:
        return -1
    elif now==len(keys):
        if sum_==0:
            return True
        else:
            return 0
    k=keys[now]
    for i in range(dic[k]+1):
        res=search(keys,dic,now+1,sum_-2*i*k)
        if res == 0:
            continue
        elif res==-1:
            break
        else:
            return True
            
    return 0

s=input()+'T'
x,y=list(map(int,input().split()))
xlist=[0 for _ in range(8000)]
ylist=[0 for _ in range(8000)]
flag='x+'
ini=0
tmp=0
xsum=0
ysum=0
for c in s:
    if c =='F':
        tmp+=1
    else:
        if flag=='x':
            xlist[tmp]+=1
            xsum+=tmp
        elif flag=='y':
            ylist[tmp]+=1
            ysum+=tmp
        else:
            ini=tmp
        tmp=0
        if flag=='y':
            flag='x'
        else:
            flag='y'
xlist[0]=0
ylist[0]=0
xkey=[]
ykey=[]
for i in range(8000):
    if xlist[i]>0:
        xkey.append(i)
    if ylist[i]>0:
        ykey.append(i)
xkey.reverse()
ykey.reverse()

if search(xkey,xlist,0,xsum-x+ini)==1 and search(ykey,ylist,0,ysum-y)==1:
    print('Yes')
else:
    print('No')

Submission Info

Judge Result