Problem p03488 (python)

Fixed submission:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

s = input()
x, y = map(int, input().split())

dpx = {0}
dpy = {0}

f = s.split("T")

fx = []
fy = []

for i, fi in enumerate(f):
    if i % 2:
        fy.append(len(fi))
    else:
        fx.append(len(fi))

for i, fxi in enumerate(fx):
    nex = set([])
    for j in dpx:
        nex.add(j+fxi)
        if i > 0:
            nex.add(j-fxi)
    dpx = nex

for fyi in fy:
    nex = set([])
    for j in dpy:
        nex.add(j+fyi)
        nex.add(j-fyi)
    dpy = nex

if x in dpx and y in dpy:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

s = input()
X, Y = getNM()
list_s = s.split('T')
N = len(list_s)

# 最初に進んだ分
X -= len(list_s[0])
x_list = []
y_list = []

for i in range(1, N):
    if i % 2 == 0:
        x_list.append(len(list_s[i]))
    else:
        y_list.append(len(list_s[i]))

def part_sum(list, limit):
    n = len(list)
    dp = [[0] * (2 * limit + 1) for i in range(n + 1)]
    dp[0][limit] = 1

    for i in range(n):
        for j in range(2 * limit + 1):
            if dp[i][j] >= 1:
                dp[i + 1][j - list[i]] += dp[i][j]
                dp[i + 1][j + list[i]] += dp[i][j]

    return dp

if (sum(x_list) == 0 and X != 0) or (sum(y_list) == 0 and Y != 0):
    print('No')
    exit()

if part_sum(x_list, sum(x_list))[-1][X + sum(x_list)] >= 1 and part_sum(y_list, sum(y_list))[-1][Y + sum(y_list)] >= 1:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

s = input()
X, Y = getNM()
list_s = s.split('T')
N = len(list_s)

# 最初に進んだ分
X -= len(list_s[0])
x_list = []
y_list = []

x_cnt = 0
y_cnt = 0
for i in range(1, N):
    if i % 2 == 0:
        x_cnt += len(list_s[i])
        x_list.append(len(list_s[i]))
    else:
        y_cnt += len(list_s[i])
        y_list.append(len(list_s[i]))

def part_sum(list, limit):
    n = len(list)
    dp = [[0] * (limit + 1) for i in range(n + 1)]
    dp[0][0] = 1

    for i in range(n):
        for j in range(limit + 1):
            if j - list[i] >= 0:
                dp[i + 1][j] += dp[i][j - list[i]]
            if j + list[i] <= limit:
                dp[i + 1][j] += dp[i][j + list[i]]

    return dp

if part_sum(x_list, x_cnt + 1)[-1][X] >= 1 and part_sum(y_list, y_cnt + 1)[-1][Y] >= 1:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

s = input()
X, Y = getNM()
list_s = s.split('T')
N = len(list_s)

# 最初に進んだ分
X -= len(list_s[0])
x_list = []
y_list = []

for i in range(1, N):
    if i % 2 == 0:
        x_list.append(len(list_s[i]))
    else:
        y_list.append(len(list_s[i]))

def part_sum(list, limit):
    n = len(list)
    dp = [[0] * (limit + 1) for i in range(n + 1)]
    dp[0][0] = 1

    for i in range(n):
        for j in range(limit + 1):
            if j - list[i] >= 0:
                dp[i + 1][j] += dp[i][j - list[i]]
            if j + list[i] <= limit:
                dp[i + 1][j] += dp[i][j + list[i]]

    return dp

if part_sum(x_list, 8001)[-1][abs(X)] >= 1 and part_sum(y_list, 8001)[-1][abs(Y)] >= 1:
    print('Yes')
else:
    print('No')