input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def primeFactor(N):
i, n, ret, d, sq = 2, N, {}, 2, 99
while i <= sq:
k = 0
while n % i == 0: n, k, ret[i] = n//i, k+1, k+1
if k > 0 or i == 97: sq = int(n**(1/2)+0.5)
if i < 4: i = i * 2 - 1
else: i, d = i+d, d^6
if n > 1: ret[n] = 1
return ret
def divisors(N):
pf = primeFactor(N)
ret = [1]
for p in pf:
ret_prev = ret
ret = []
for i in range(pf[p]+1):
for r in ret_prev:
ret.append(r * (p ** i))
return sorted(ret)
def f(b, n):
re = 0
while n:
re += n % b
n //= b
return re
N = int(eval(input()))
S = int(eval(input()))
for b in divisors(abs(N-S)):
b += 1
if f(b, N) == S:
print(b)
break
else:
print((-1))
| def primeFactor(N):
i, n, ret, d, sq = 2, N, {}, 2, 99
while i <= sq:
k = 0
while n % i == 0: n, k, ret[i] = n//i, k+1, k+1
if k > 0 or i == 97: sq = int(n**(1/2)+0.5)
if i < 4: i = i * 2 - 1
else: i, d = i+d, d^6
if n > 1: ret[n] = 1
return ret
def divisors(N):
pf = primeFactor(N)
ret = [1]
for p in pf:
ret_prev = ret
ret = []
for i in range(pf[p]+1):
for r in ret_prev:
ret.append(r * (p ** i))
return sorted(ret)
def f(b, n):
re = 0
while n:
re += n % b
n //= b
return re
N = int(eval(input()))
S = int(eval(input()))
if N < S:
print((-1))
elif N == S:
print((N+1))
else:
for b in divisors(N-S):
b += 1
if f(b, N) == S:
print(b)
break
else:
print((-1))
| p04014 |
n = int(eval(input()))
s = int(eval(input()))
rtn = -1* int( -1 * (n**0.5))
def f(b,n):
if n<b:
return n
return f(b,n//b) + n % b
if n < s or (n // 2)+1 < s < n :
print("-1")
elif s == n:
print((n+1))
elif s == n//2 +1:
if n % 2 == 1:
print((n//2 + 1))
else:
print("-1")
elif (n//3) + 2 < s <= n//2:
print((n-s+1))
else:
x = n // s
if s - (n //(x+1)) <= x:
x = x + 1
if 5 < n/(x -1) - n/x :
for b in range(n//x, n//(x-1)):
if f(b,n) == s:
print(b)
exit()
for i in range(x-1,2,-1):
for b in range(n//i + (n//x)//(n//i), n//i + (n//x)//(n//i) + (2*n//x - n//(x+1))//(x-i)):
if f(b,n) == s:
print(b)
exit()
else:
for b in range(2,rtn+1):
if f(b,n) == s:
print(b)
exit()
for p in range(rtn,0,-1):
if (n-s) % p == 0:
b = (n-s)//p + 1
if f(b,n) == s:
print(b)
exit()
print((n-s+1))
| n = int(eval(input()))
s = int(eval(input()))
rtn = -1* int( -1 * (n**0.5))
def f(b,n):
if n<b:
return n
return f(b,n//b) + n % b
if n < s or (n // 2)+1 < s < n :
print("-1")
elif s == n:
print((n+1))
elif s == n//2 +1:
if n % 2 == 1:
print((n//2 + 1))
else:
print("-1")
elif (n//3) + 2 < s <= n//2:
print((n-s+1))
else:
for b in range(2,rtn+1):
if f(b,n) == s:
print(b)
exit()
for p in range(rtn,0,-1):
if (n-s) % p == 0:
b = (n-s)//p + 1
if f(b,n) == s:
print(b)
exit()
print((n-s+1))
| p04014 |
from math import floor, sqrt, ceil
def f(b, n):
if b < 2:
return 0
if n < b:
return n
return f(b, floor(n / b)) + n % b
n = int(eval(input()))
s = int(eval(input()))
if n == s:
print((n + 1))
exit()
for b in range(2, floor(sqrt(n)) + 1):
if f(b, n) == s:
print(b)
exit()
for p in range(1, ceil(sqrt(n)))[::-1]:
b = (n - s) / p + 1
if b.is_integer():
b = int(b)
if 1 <= p < b and 0 <= s - p < b:
print(b)
exit()
print((-1))
| from math import floor, sqrt, ceil
def f(b, n):
if n < b:
return n
return f(b, floor(n / b)) + n % b
n = int(eval(input()))
s = int(eval(input()))
if n == s:
print((n + 1))
exit()
for b in range(2, floor(sqrt(n)) + 1):
if f(b, n) == s:
print(b)
exit()
for p in range(1, ceil(sqrt(n)))[::-1]:
b = (n - s) / p + 1
if b.is_integer():
b = int(b)
if 1 <= p < b and 0 <= s - p < b:
print(b)
exit()
print((-1))
| p04014 |
import math
n = int(eval(input()))
s = int(eval(input()))
result = -1
if n == s:
result = n + 1
elif s > n:
pass
else:
sqrt_n = math.floor(math.sqrt(n))
for b in range(2, sqrt_n + 1):
temp_n = n
temp_b = 0
while temp_n >= b:
temp_b += temp_n % b
temp_n = temp_n // b
if temp_b + temp_n == s:
result = b
break
if result == -1:
for quot in range(sqrt_n, 0, -1):
if n - s % quot != 0:
b = (n - s) // quot + 1
temp_n = n
temp_b = 0
while temp_n >= b:
temp_b += temp_n % b
temp_n = temp_n // b
if temp_b + temp_n == s:
result = b
break
print(result) | import math
n = int(eval(input()))
s = int(eval(input()))
result = -1
if n == s:
result = n + 1
elif s > n:
pass
else:
temp_sqrt_n = math.floor(math.sqrt(n))
for b in range(2, temp_sqrt_n + 1):
temp_n = n
temp_b = 0
while temp_n >= b:
temp_b += temp_n % b
temp_n = temp_n // b
if temp_b + temp_n == s:
result = b
break
if result == -1:
temp_sqrt_n = math.floor(math.sqrt(n - 1))
for quot in range(temp_sqrt_n, 0, -1):
if n - s % quot != 0:
b = (n - s) // quot + 1
if quot + n % b == s:
result = b
break
print(result) | p04014 |
import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
C = []
for y in range(H):
B.append(list(map(int, input().split())))
C.append(list(abs(a-b) for (a, b) in zip(A[y], B[y])))
VMAX = 80*159+1
dp = [[[0] * VMAX for _ in range(W)] for _ in range(H)]
dp[0][0][C[0][0]] = 1
for y in range(H):
for x in range(W):
if y==0 and x==0:
continue
for v in range(VMAX):
if y-1 >= 0 and dp[y-1][x][v]:
if abs(v+C[y][x]) < VMAX:
dp[y][x][abs(v+C[y][x])] = 1
dp[y][x][abs(v-C[y][x])] = 1
if x-1 >= 0 and dp[y][x-1][v]:
if abs(v+C[y][x]) < VMAX:
dp[y][x][abs(v+C[y][x])] = 1
dp[y][x][abs(v-C[y][x])] = 1
ans = -1
for v in range(VMAX):
if dp[-1][-1][v]:
ans = v
break
print(ans) | import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
C = []
for y in range(H):
B.append(list(map(int, input().split())))
C.append(list(abs(a-b) for (a, b) in zip(A[y], B[y])))
VMAX = 80*159+1
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] |= 1 << C[0][0]
for y in range(H):
for x in range(W):
if y==0 and x==0:
continue
if y-1 >= 0:
dp[y][x] |= dp[y-1][x] << C[y][x]
dp[y][x] |= dp[y-1][x] >> C[y][x]
d = C[y][x]+1
r = format(dp[y-1][x] & (2**d-1), '0'+str(d)+'b')
r = r[::-1]
dp[y][x] |= int(r, 2)
if x-1 >= 0:
dp[y][x] |= dp[y][x-1] << C[y][x]
dp[y][x] |= dp[y][x-1] >> C[y][x]
d = C[y][x]+1
r = format(dp[y][x-1] & (2**d-1), '0'+str(d)+'b')
r = r[::-1]
dp[y][x] |= int(r, 2)
ans = -1
for v in range(VMAX):
if dp[-1][-1] >> v & 1:
ans = v
break
print(ans) | p02839 |
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
c=[[0]*w for i in range(h)]
for i in range(h):
for j in range(w):
c[i][j]=abs(a[i][j]-b[i][j])
dp=[[[0]*(80*(h+w)+1) for i in range(w)] for j in range(h)]
dp[0][0][c[0][0]]=1
for i in range(h):
for j in range(w):
for k in range(80*(i+j)+1):
if dp[i-1][j][abs(k-c[i][j])]==1 or dp[i][j-1][abs(k-c[i][j])]==1 or dp[i-1][j][k+c[i][j]]==1 or dp[i][j-1][k+c[i][j]]:
dp[i][j][k]=1
for i in range(80*(h+w)+1):
if dp[h-1][w-1][i]==1:
print(i)
break | h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
c=[[0]*w for i in range(h)]
for i in range(h):
for j in range(w):
c[i][j]=abs(a[i][j]-b[i][j])
dp=[[[] for i in range(w)] for j in range(h)]
dp[0][0].append(c[0][0])
for i in range(h):
for j in range(w):
for k in range(len(dp[i-1][j])):
dp[i][j].append(abs(dp[i-1][j][k]-c[i][j]))
dp[i][j].append(dp[i-1][j][k]+c[i][j])
for k in range(len(dp[i][j-1])):
dp[i][j].append(abs(dp[i][j-1][k]-c[i][j]))
dp[i][j].append(dp[i][j-1][k]+c[i][j])
dp[i][j]=list(set(dp[i][j]))
print((min(dp[h-1][w-1]))) | p02839 |
import sys
input=sys.stdin.readline
def main():
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
dp=[[[0]*(80*(h+w+1)+1) for i in range(w)] for j in range(h)]
dp[0][0][abs(a[0][0]-b[0][0])]=1
for i in range(h):
for j in range(w):
c=abs(a[i][j]-b[i][j])
if i!=0 or j!=0:
for k in range(80*(i+j+1)+1):
dp[i][j][k]=dp[i-1][j][abs(k-c)]|dp[i-1][j][k+c]|dp[i][j-1][abs(k-c)]|dp[i][j-1][k+c]
for i in range(80*(h+w+1)+1):
if dp[h-1][w-1][i]==1:
print(i)
break
if __name__=='__main__':
main() | def main():
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
dp=[[[0]*(80*(h+w+1)+1) for i in range(w)] for j in range(h)]
dp[0][0][abs(a[0][0]-b[0][0])]=1
for i in range(h):
for j in range(w):
c=abs(a[i][j]-b[i][j])
if i!=0 or j!=0:
for k in range(80*(i+j+1)+1):
dp[i][j][k]=dp[i-1][j][abs(k-c)]|dp[i-1][j][k+c]|dp[i][j-1][abs(k-c)]|dp[i][j-1][k+c]
for i in range(80*(h+w+1)+1):
if dp[h-1][w-1][i]==1:
print(i)
break
if __name__=='__main__':
main() | p02839 |
#!/usr/bin/env python3
import sys
def solve(H: int, W: int, A: "List[List[int]]", B: "List[List[int]]"):
ab = [[0]*W for _ in range(H)]
for h in range(H):
for w in range(W):
ab[h][w] = abs(A[h][w]-B[h][w])
# i,jにいるときに作れる値
setlist = [[set() for _ in range(W)] for _ in range(H)]
for i in range(H):
for j in range(W):
if i == 0 and j == 0:
setlist[i][j].add(ab[i][j])
continue
if i == 0:
for num in setlist[i][j-1]:
setlist[i][j].add(abs(num+ab[i][j]))
setlist[i][j].add(abs(num-ab[i][j]))
continue
if j == 0:
for num in setlist[i-1][j]:
setlist[i][j].add(abs(num+ab[i][j]))
setlist[i][j].add(abs(num-ab[i][j]))
continue
for num in setlist[i-1][j]:
setlist[i][j].add(abs(num+ab[i][j]))
setlist[i][j].add(abs(num-ab[i][j]))
for num in setlist[i][j-1]:
setlist[i][j].add(abs(num+ab[i][j]))
setlist[i][j].add(abs(num-ab[i][j]))
print((min(setlist[H-1][W-1])))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
H = int(next(tokens)) # type: int
W = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] # type: "List[List[int]]"
B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] # type: "List[List[int]]"
solve(H, W, A, B)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(H: int, W: int, A: "List[List[int]]", B: "List[List[int]]"):
SA=[[0]*W for i in range(H)]
MAX = (H+W)*80
for i in range(H):
for j in range(W):
SA[i][j]=abs(A[i][j]-B[i][j])
DP=[[0 for i in range(W)] for j in range(H)]
DP[0][0]=1<<MAX+SA[0][0]
for i in range(H):
for j in range(W):
tempbit=DP[i][j]
if i<H-1:
DP[i+1][j]|=tempbit<<SA[i+1][j]
DP[i+1][j]|=tempbit>>SA[i+1][j]
if j<W-1:
DP[i][j+1]|=tempbit<<SA[i][j+1]
DP[i][j+1]|=tempbit>>SA[i][j+1]
ANS=1<<MAX*2
for i in range(MAX*2+1):
if 1<<i & DP[-1][-1]!=0:
ANS=min(ANS,abs(i-MAX))
print(ANS)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
H = int(next(tokens)) # type: int
W = int(next(tokens)) # type: int
A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] # type: "List[List[int]]"
B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] # type: "List[List[int]]"
solve(H, W, A, B)
if __name__ == '__main__':
main()
| p02839 |
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
H, W = list(map(int, input().split()))
A = [0] * H
for i in range(H):
A[i] = list(map(int, input().split()))
B = [0] * H
for i in range(H):
B[i] = list(map(int, input().split()))
C = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j] - B[i][j])
MAX = H * W
dp = [[[INF] * W for _ in range(H)] for _ in range(MAX)]
for k in range(MAX):
for i in range(H):
for j in range(W):
if k == 0:
if i == 0 and j == 0:
dp[k][i][j] = C[i][j]
elif i == 0:
dp[k][i][j] = dp[k][i][j - 1] + C[i][j]
elif j == 0:
dp[k][i][j] = dp[k][i - 1][j] + C[i][j]
else:
dp[k][i][j] = min(dp[k][i - 1][j], dp[k][i][j - 1]) + C[i][j]
else:
if i == 0 and j == 0:
continue
elif i == 0:
dp[k][i][j] = min(abs(dp[k - 1][i][j - 1] - C[i][j]), dp[k][i][j])
elif j == 0:
dp[k][i][j] = min(abs(dp[k - 1][i - 1][j] - C[i][j]), dp[k][i][j])
else:
dp[k][i][j] = min(abs(dp[k - 1][i - 1][j] - C[i][j]), \
abs(dp[k - 1][i][j - 1] - C[i][j]), dp[k][i][j])
ans = INF
for k in range(MAX):
val = dp[k][H - 1][W - 1]
ans = min(ans, val)
print(ans) | import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
H,W = list(map(int,readline().split()))
A = [list(map(int,readline().split())) for _ in range(H)]
B = [list(map(int,readline().split())) for _ in range(H)]
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
X = (H + W) * 80
L = X + X + 1
dp = [[0] * W for _ in range(H)]
# X点持った状態から始める
dp[0][0] |= 1 << (X - C[0][0])
dp[0][0] |= 1 << (X + C[0][0])
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i - 1][j] << C[i][j]
dp[i][j] |= dp[i - 1][j] >> C[i][j]
if j > 0:
dp[i][j] |= dp[i][j - 1] << C[i][j]
dp[i][j] |= dp[i][j - 1] >> C[i][j]
ans = L
for i in range(L):
if dp[-1][-1] & 1 << i > 0:
ans = min(ans, abs(i - X))
print(ans)
| p02839 |
h, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(h)]
b = [list(map(int, input().split())) for i in range(h)]
c = [[abs(a[i][j] - b[i][j]) for j in range(w)] for i in range(h)]
sets = [[set() for j in range(w)] for i in range(h)]
sets[0][0].add(c[0][0])
for i in range(1, h):
for e in sets[i - 1][0]:
sets[i][0].add(e + c[i][0])
sets[i][0].add(abs(e - c[i][0]))
for i in range(1, w):
for e in sets[0][i - 1]:
sets[0][i].add(e+c[0][i])
sets[0][i].add(abs(e-c[0][i]))
for i in range(1, h):
for j in range(1, w):
for e in sets[i-1][j]:
sets[i][j].add(e+c[i][j])
sets[i][j].add(abs(e - c[i][j]))
for e in sets[i][j-1]:
sets[i][j].add(e+c[i][j])
sets[i][j].add(abs(e-c[i][j]))
print((min(sets[h - 1][w - 1])))
| h, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(h)]
b = [list(map(int, input().split())) for i in range(h)]
c = [[abs(a[i][j] - b[i][j]) for j in range(w)] for i in range(h)]
mask = (1 << (h+w) * 80) - 1
sets = [[0 for j in range(w)] for i in range(h)]
sets[0][0] = (1 << 80+c[0][0]) | (1 << 80-c[0][0])
for i in range(1, h):
sets[i][0] |= (sets[i - 1][0] << 80 + c[i][0]
) | (sets[i - 1][0] << 80 - c[i][0])
for i in range(1, w):
sets[0][i] |= (sets[0][i-1] << 80 + c[0][i]
) | (sets[0][i-1] << 80 - c[0][i])
for i in range(1, h):
for j in range(1, w):
sets[i][j] |= (sets[i - 1][j] << 80 + c[i][j]
) | (sets[i - 1][j] << 80 - c[i][j])
sets[i][j] |= (sets[i][j-1] << 80 + c[i][j]
) | (sets[i][j - 1] << 80 - c[i][j])
sets[i][j] &= mask
s = bin(sets[h - 1][w - 1] + (1 << (h + w) * 80))
min_v = 1 << 80
for i in range(len(s)):
if s[-1-i] == '1':
min_v = min(min_v, abs(i - (h + w) * 80 + 80))
print(min_v)
| p02839 |
def main():
h, w = list(map(int, input().split()))
grid = [[0] * (w + 1)]
for _ in range(h):
grid.append([0] + list(map(int, input().split())))
for i in range(1, h + 1):
l = [0] + list(map(int, input().split()))
for j in range(w + 1):
grid[i][j] = abs(grid[i][j] - l[j])
biggest = max([max(i) for i in grid])
m = (h + w) * biggest
if m == 0:
print((0))
exit()
unba = [[[False] * m for _ in range(w + 1)] for _ in range(h + 1)]
# trueplace = [[[] for _ in range(w + 1)] for _ in range(h + 1)]
for i in range(1, w + 1):
unba[0][i][0] = True
for i in range(1, h + 1):
unba[i][0][0] = True
for i in range(1, h + 1):
for j in range(1, w + 1):
for k in range(m):
if unba[i-1][j][k] or unba[i][j-1][k]:
unba[i][j][grid[i][j] + k] = True
unba[i][j][abs(grid[i][j] - k)] = True
l = [i for i in range(m) if unba[h][w][i]]
print((min(l)))
main() | def main():
from sys import stdin
def input():
return stdin.readline().strip()
h, w = list(map(int, input().split()))
g = []
for _ in range(h):
g.append(list(map(int, input().split())))
for i in range(h):
k = list(map(int, input().split()))
for j in range(w):
g[i][j] = abs(g[i][j] - k[j])
m = (h + w) * 80
if m == 0:
print((0))
exit()
dp = [[False] * m for _ in range(w)]
dp[0][g[0][0]] = True
for j in range(1, w):
for k in range(m):
if dp[j-1][k]:
dp[j][abs(k - g[0][j])] = True
dp[j][k + g[0][j]] = True
for i in range(1, h):
new_dp = [[False] * m for _ in range(w)]
for k in range(m):
if dp[0][k]:
new_dp[0][abs(k - g[i][0])] = True
new_dp[0][k + g[i][0]] = True
for j in range(1, w):
for k in range(m):
if new_dp[j-1][k] or dp[j][k]:
new_dp[j][abs(k - g[i][j])] = True
new_dp[j][k + g[i][j]] = True
dp = new_dp
for j in range(m):
if dp[w-1][j]:
print(j)
break
main() | p02839 |
def main():
from sys import stdin
def input():
return stdin.readline().strip()
h, w = list(map(int, input().split()))
g = []
for _ in range(h):
g.append(list(map(int, input().split())))
for i in range(h):
k = list(map(int, input().split()))
for j in range(w):
g[i][j] = abs(g[i][j] - k[j])
m = (h + w) * 80
if m == 0:
print((0))
exit()
dp = [[False] * m for _ in range(w)]
dp[0][g[0][0]] = True
for j in range(1, w):
for k in range(m):
if dp[j-1][k]:
dp[j][abs(k - g[0][j])] = True
dp[j][k + g[0][j]] = True
for i in range(1, h):
new_dp = [[False] * m for _ in range(w)]
for k in range(m):
if dp[0][k]:
new_dp[0][abs(k - g[i][0])] = True
new_dp[0][k + g[i][0]] = True
for j in range(1, w):
for k in range(m):
if new_dp[j-1][k] or dp[j][k]:
new_dp[j][abs(k - g[i][j])] = True
new_dp[j][k + g[i][j]] = True
dp = new_dp
for j in range(m):
if dp[w-1][j]:
print(j)
break
main() | def main():
from sys import stdin
def input():
return stdin.readline().strip()
h, w = list(map(int, input().split()))
g = []
for _ in range(h):
g.append(list(map(int, input().split())))
for i in range(h):
k = list(map(int, input().split()))
for j in range(w):
g[i][j] = abs(g[i][j] - k[j])
m = (h + w) * 50
if m == 0:
print((0))
exit()
dp = [[False] * m for _ in range(w)]
dp[0][g[0][0]] = True
for j in range(1, w):
for k in range(m):
if dp[j-1][k]:
dp[j][abs(k - g[0][j])] = True
try:
dp[j][k + g[0][j]] = True
except:
pass
for i in range(1, h):
new_dp = [[False] * m for _ in range(w)]
for k in range(m):
if dp[0][k]:
new_dp[0][abs(k - g[i][0])] = True
try:
new_dp[0][k + g[i][0]] = True
except:
pass
for j in range(1, w):
for k in range(m):
if new_dp[j-1][k] or dp[j][k]:
new_dp[j][abs(k - g[i][j])] = True
try:
new_dp[j][k + g[i][j]] = True
except:
pass
dp = new_dp
for j in range(m):
if dp[w-1][j]:
print(j)
break
main() | p02839 |
import copy
def main():
h, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
n = 2*80*160 + 10
m = n//2
dp = [[[False]*n for j in range(w)] for i in range(h)]
dp[0][0][m+abs(a[0][0] - b[0][0])] = True
dp[0][0][m-abs(a[0][0] - b[0][0])] = True
for i in range(h):
for j in range(w):
x = abs(a[i][j] - b[i][j])
if 0 < i and 0 < h:
for k in range(x, n-x):
if dp[i-1][j][k] or dp[i][j-1][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
elif 0 < i:
for k in range(x, n-x):
if dp[i-1][j][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
elif 0 < j:
for k in range(x, n-x):
if dp[i][j-1][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
ans = float("inf")
for i in range(n):
if dp[h-1][w-1][i]:
ans = min(ans, abs(m-i))
print(ans)
if __name__ == "__main__":
main()
| def main():
h, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
n = 2000
m = n//2
dp = [[[False]*n for j in range(w)] for i in range(h)]
dp[0][0][m+abs(a[0][0] - b[0][0])] = True
dp[0][0][m-abs(a[0][0] - b[0][0])] = True
for i in range(h):
for j in range(w):
x = abs(a[i][j] - b[i][j])
if 0 < i and 0 < h:
for k in range(x, n-x):
if dp[i-1][j][k] or dp[i][j-1][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
elif 0 < i:
for k in range(x, n-x):
if dp[i-1][j][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
elif 0 < j:
for k in range(x, n-x):
if dp[i][j-1][k]:
dp[i][j][k-x] = True
dp[i][j][k+x] = True
ans = float("inf")
for i in range(n):
if dp[h-1][w-1][i]:
ans = min(ans, abs(m-i))
print(ans)
if __name__ == "__main__":
main()
| p02839 |
H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(H)]
B = [list(map(int,input().split())) for _ in range(H)]
C = [[0 for j in range(W)] for i in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
dp = [[[0 for k in range(6400)] for j in range(W)] for i in range(H)]
dp[0][0][C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(6400):
if not dp[i][j][k]:
continue
ni,nj = i+1,j+1
if ni < H:
if k+C[ni][j]<6400:
dp[ni][j][k+C[ni][j]] = 1
dp[ni][j][abs(k-C[ni][j])] = 1
if nj < W:
if k+C[i][nj]<6400:
dp[i][nj][k+C[i][nj]] = 1
dp[i][nj][abs(k-C[i][nj])] = 1
for k in range(6400):
if dp[-1][-1][k]:
print(k)
break | def main():
H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(H)]
B = [list(map(int,input().split())) for _ in range(H)]
C = [[0 for j in range(W)] for i in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
dp = [[0 for k in range(6400)] for g in range(H*W)]
dp[0][C[0][0]] = 1
for g in range(H*W):
i,j = divmod(g,W)
for k in range(6400):
if not dp[i*W+j][k]:
continue
ni,nj = i+1,j+1
if ni < H:
if k+C[ni][j]<6400:
dp[ni*W+j][k+C[ni][j]] = 1
dp[ni*W+j][abs(k-C[ni][j])] = 1
if nj < W:
if k+C[i][nj]<6400:
dp[i*W+nj][k+C[i][nj]] = 1
dp[i*W+nj][abs(k-C[i][nj])] = 1
for k in range(6400):
if dp[-1][k]:
print(k)
break
main() | p02839 |
def main():
import sys
H, W = list(map(int, sys.stdin.readline().split()))
A = [list(map(int, sys.stdin.readline().split())) for i in range(H)]
B = [list(map(int, sys.stdin.readline().split())) for i in range(H)]
X = [[0] * W for i in range(H)]
for h in range(H):
for w in range(W):
X[h][w] = abs(A[h][w] - B[h][w])
dp = {}
dp[0] = set()
dp[0].add(X[0][0])
dp[0].add(-X[0][0])
for h in range(H):
for w in range(W):
if h == 0 and w == 0:
continue
x = X[h][w]
s = set()
threshold = ((H - h) + (W - w)) * 79
if W * h + w > W - 1:
for d in dp[W * (h - 1) + w]:
if d + x <= threshold:
s.add(d + x)
if d - x >= -threshold:
s.add(d - x)
if (W * h + w) % W != 0:
for d in dp[W * h + w - 1]:
if d + x <= threshold:
s.add(d + x)
if d - x >= -threshold:
s.add(d - x)
dp[W * h + w] = s
ans = min([abs(s) for s in dp[W * H - 1]])
print(ans)
if __name__ == '__main__':
main()
| def main():
import sys
H, W = list(map(int, sys.stdin.readline().split()))
A = [list(map(int, sys.stdin.readline().split())) for i in range(H)]
B = [list(map(int, sys.stdin.readline().split())) for i in range(H)]
X = [[0] * W for i in range(H)]
for h in range(H):
for w in range(W):
X[h][w] = abs(A[h][w] - B[h][w])
dp = [[set() for j in range(W)] for i in range(H)]
dp[0][0].add(X[0][0])
dp[0][0].add(-X[0][0])
for h in range(H):
for w in range(W):
if h == 0 and w == 0:
continue
x = X[h][w]
s = set()
if h > 0:
for d in dp[h - 1][w]:
s.add(d + x)
s.add(abs(d - x))
if w > 0:
for d in dp[h][w - 1]:
s.add(d + x)
s.add(abs(d - x))
dp[h][w] = s
ans = min([abs(s) for s in dp[H - 1][W - 1]])
print(ans)
if __name__ == '__main__':
main()
| p02839 |
def main():
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
h,w = list(map(int,readline().split()))
a = []
for i in range(h):
s = list(map(int,readline().split()))
a.append(s)
b = []
for i in range(h):
t = list(map(int,readline().split()))
b.append(t)
C = [[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
C[i][j] = abs(a[i][j] - b[i][j])
dp = [[[0]*6321 for i in range(w)] for _ in range(h)]
dp[0][0][C[0][0]] = 1
for i in range(h):
for j in range(w):
for k in range(6321):
if dp[i][j][k]:
if i < h-1:
c = C[i+1][j]
if k+c < 6321:
dp[i+1][j][k+c] = 1
dp[i+1][j][abs(k-c)] = 1
if j < w-1:
d = C[i][j+1]
if k+d < 6321:
dp[i][j+1][k+d] = 1
dp[i][j+1][abs(k-d)] = 1
for i in range(6321):
if dp[h-1][w-1][i]:
print(i)
break
if __name__ == "__main__":
main() | import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
a = []
for i in range(h):
s = list(map(int,input().split()))
a.append(s)
b = []
for i in range(h):
s = list(map(int,input().split()))
b.append(s)
dp = [[0]*w for i in range(h)]
t = 80*(h+w)
dp[0][0] = 2**(t+abs(a[0][0]-b[0][0]))
for i in range(h):
for j in range(w):
r = abs(a[i][j]-b[i][j])
if j > 0:
dp[i][j] |= (dp[i][j-1]<<r | dp[i][j-1]>>r)
if i > 0:
dp[i][j] |= (dp[i-1][j]<<r | dp[i-1][j]>>r)
a = dp[h-1][w-1]>>t
m = a&(-a)
print((m.bit_length()-1)) | p02839 |
H, W = list(map(int, input().split()))
A = [None]*H
for i in range(H):
A[i] = list(map(int, input().split()))
B = [None]*H
for i in range(H):
B[i] = list(map(int, input().split()))
# C: A-Bの絶対値を持つ
C = [[None]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
INF = 10**12
K = 2*80*(H+W-1)
dp = [[[0]*(K+1) for _ in range(W)] for _ in range(H)]# 答えから80*(H+W-1)を引く
dp[0][0][80*(H+W-1)+C[0][0]] = 1
dp[0][0][80*(H+W-1)-C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(K+1):
if i > 0 and dp[i-1][j][k] > 0:
dp[i][j][k+C[i][j]] += dp[i-1][j][k]
dp[i][j][k-C[i][j]] += dp[i-1][j][k]
if j > 0 and dp[i][j-1][k] > 0:
dp[i][j][k+C[i][j]] += dp[i][j-1][k]
dp[i][j][k-C[i][j]] += dp[i][j-1][k]
ans = INF
for k in range(K+1):
res = dp[H-1][W-1][k]
if res > 0:
ans = min(ans, abs(k-80*(H+W-1)))
print(ans) | H, W = list(map(int, input().split()))
A = [None]*H
for i in range(H):
A[i] = list(map(int, input().split()))
B = [None]*H
for i in range(H):
B[i] = list(map(int, input().split()))
# C: A-Bの絶対値を持つ
C = [[None]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
K = 80*(H+W-1)
dp = [[[0]*(K+1) for _ in range(W)] for _ in range(H)]
dp[0][0][C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(K+1):
if i and dp[i-1][j][k]:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
if j and dp[i][j-1][k]:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
for k in range(K+1):
res = dp[H-1][W-1][k]
if res:
print(k)
exit() | p02839 |
H, W = list(map(int, input().split()))
A = [None]*H
for i in range(H):
A[i] = list(map(int, input().split()))
B = [None]*H
for i in range(H):
B[i] = list(map(int, input().split()))
# C: A-Bの絶対値を持つ
C = [[None]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
K = 80*(H+W-1)
dp = [[[0]*(K+1) for _ in range(W)] for _ in range(H)]
dp[0][0][C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(K+1):
if i and dp[i-1][j][k]:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
if j and dp[i][j-1][k]:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
for k in range(K+1):
res = dp[H-1][W-1][k]
if res:
print(k)
exit() | H, W = list(map(int, input().split()))
A = [None]*H
for i in range(H):
A[i] = list(map(int, input().split()))
B = [None]*H
for i in range(H):
B[i] = list(map(int, input().split()))
# C: A-Bの絶対値を持つ
C = [[None]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
K = 80*(H+W-1)//2 + 1# 80*(H+W-1)の半分を超えるのは無駄
dp = [[[0]*(K+1) for _ in range(W)] for _ in range(H)]# 答えから80*(H+W-1)を引く
dp[0][0][C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(K+1):
if i and dp[i-1][j][k]:
if k+C[i][j] < K:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
if j and dp[i][j-1][k]:
if k+C[i][j] < K:
dp[i][j][k+C[i][j]] = 1
dp[i][j][abs(k-C[i][j])] = 1
for k in range(K+1):
res = dp[H-1][W-1][k]
if res:
print(k)
break | p02839 |
H,W=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(H)]
B=[list(map(int,input().split())) for _ in range(H)]
num=(H+W)*80+1
#dp[i][j]=マス(i,j)における可能なポイントのリスト
dp=[[[False]*(num) for _ in range(W)] for _ in range(H)]
dp[0][0][0]=True
for i in range(W+H-1):
I,J=0,0
if i < H:
I=i
J=0
else:
I=H-1
J=i-H+1
while I>=0 and J<W:
sa = abs(A[I][J] - B[I][J])
for n in range(num):
if not dp[I][J][n]:
continue
if I!=H-1:
dp[I+1][J][n+sa]=True
dp[I+1][J][abs(n-sa)]=True
if J!=W-1:
dp[I][J+1][n+sa]=True
dp[I][J+1][abs(n-sa)]=True
I-=1
J+=1
sa = abs(A[H-1][W-1] - B[H-1][W-1])
ans=float("inf")
for n in range(num):
if not dp[-1][-1][n]:
continue
ans = min(ans,abs(n-sa),n+sa)
print(ans) | H,W=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(H)]
B=[list(map(int,input().split())) for _ in range(H)]
#dp[i][j]=マス(i,j)における可能なポイントのリスト
dp=[[set() for _ in range(W)] for _ in range(H)]
dp[0][0].add(0)
for i in range(W+H-1):
I,J=0,0
if i < H:
I=i
J=0
else:
I=H-1
J=i-H+1
while I>=0 and J<W:
sa = abs(A[I][J] - B[I][J])
for point in dp[I][J]:
if I!=H-1:
dp[I+1][J].add(point+sa)
dp[I+1][J].add(abs(point-sa))
if J!=W-1:
dp[I][J+1].add(point+sa)
dp[I][J+1].add(abs(point-sa))
I-=1
J+=1
ans=dp[H-1][W-1]
sa = abs(A[H-1][W-1] - B[H-1][W-1])
res=float("inf")
for p in ans:
res=min(res,abs(p+sa),abs(p-sa))
print(res) | p02839 |
h,w = list(map(int, input().split()))
a = [list(map(int, input().split()))+[0] for i in range(h)] + [[0]*(w+1)]
b = [list(map(int, input().split()))+[0] for i in range(h)] + [[0]*(w+1)]
diff = [[x-y for x,y in zip(i,j)] for i,j in zip(a,b)]
diff_set = [[set() for j in range(w+1)] for i in range(h+1)]
diff_set[0][0].add(diff[0][0])
for i in range(h):
for j in range(w):
for x in diff_set[i][j]:
diff_set[i][j+1].add(abs(x+diff[i][j+1]))
diff_set[i][j+1].add(abs(x-diff[i][j+1]))
diff_set[i+1][j].add(abs(x+diff[i+1][j]))
diff_set[i+1][j].add(abs(x-diff[i+1][j]))
ans = min(diff_set[h-1][w-1])
print(ans) | h,w = list(map(int, input().split()))
a = [list(map(int, input().split()))+[0] for i in range(h)] + [[0]*(w+1)]
b = [list(map(int, input().split()))+[0] for i in range(h)] + [[0]*(w+1)]
diff = [[abs(x-y) for x,y in zip(i,j)] for i,j in zip(a,b)]
dp = [[0 for j in range(w+1)] for i in range(h+1)]
dp[0][0] = (1 << diff[0][0])
def reverse(d, x):
res = 0
for i in range(x+1):
res <<= 1
if (1<<i) & d:
res |= 1
return res
for i in range(h):
for j in range(w):
dp[i][j+1] |= (dp[i][j] << diff[i][j+1])
dp[i][j+1] |= (dp[i][j] >> diff[i][j+1])
dp[i][j+1] |= reverse(dp[i][j], diff[i][j+1])
dp[i+1][j] |= (dp[i][j] << diff[i+1][j])
dp[i+1][j] |= (dp[i][j] >> diff[i+1][j])
dp[i+1][j] |= reverse(dp[i][j], diff[i+1][j])
last = dp[h-1][w-1]
for i in range(6401):
if (last >> i) & 1:
ans = i
break
print(ans) | p02839 |
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = list(map(int, input().split()))
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
"""
明らかなdp臭。
dp[i][j] = (マス(0, 0)から(i, j)に進むときの偏りとしてありうるものの集合)
とおく。(0<=i<=H-1, 0<=j<=W-1, 0<=d<=80)
"""
dp = [[set([]) for _ in range(W)] for _ in range(H)]
dp[0][0].add(abs(A[0][0] - B[0][0]))
for i in range(1, H):
diff = A[i][0] - B[i][0]
for val in dp[i - 1][0]:
dp[i][0].add(abs(val + diff))
dp[i][0].add(abs(val - diff))
for j in range(1, W):
diff = A[0][j] - B[0][j]
for val in dp[0][j - 1]:
dp[0][j].add(abs(val + diff))
dp[0][j].add(abs(val - diff))
for i in range(1, H):
for j in range(1, W):
diff = A[i][j] - B[i][j]
for val in dp[i - 1][j]:
dp[i][j].add(abs(val + diff))
dp[i][j].add(abs(val - diff))
for val in dp[i][j - 1]:
dp[i][j].add(abs(val + diff))
dp[i][j].add(abs(val - diff))
print((min(dp[H - 1][W - 1])))
if __name__ == "__main__":
main()
| import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = list(map(int, input().split()))
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
"""
明らかなdp臭。
dp[i][j] = (マス(0, 0)から(i, j)に進むときの偏りとしてありうるものの集合)
とおく。(0<=i<=H-1, 0<=j<=W-1, 0<=d<=80)
"""
dp = [[set([]) for _ in range(W)] for _ in range(H)]
dp[0][0].add(abs(A[0][0] - B[0][0]))
for i in range(1, H):
diff = A[i][0] - B[i][0]
for val in dp[i - 1][0]:
if abs(val + diff) <= 1600: dp[i][0].add(abs(val + diff))
if abs(val - diff) <= 1600: dp[i][0].add(abs(val - diff))
for j in range(1, W):
diff = A[0][j] - B[0][j]
for val in dp[0][j - 1]:
if abs(val + diff) <= 6400: dp[0][j].add(abs(val + diff))
if abs(val - diff) <= 6400: dp[0][j].add(abs(val - diff))
for i in range(1, H):
for j in range(1, W):
diff = A[i][j] - B[i][j]
for val in dp[i - 1][j]:
if abs(val + diff) <= 6400: dp[i][j].add(abs(val + diff))
if abs(val - diff) <= 6400: dp[i][j].add(abs(val - diff))
for val in dp[i][j - 1]:
if abs(val + diff) <= 6400: dp[i][j].add(abs(val + diff))
if abs(val - diff) <= 6400: dp[i][j].add(abs(val - diff))
print((min(dp[H - 1][W - 1])))
if __name__ == "__main__":
main()
| p02839 |
import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
X = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp = [[[0] * (80 * 80 * 2 + 1) for _ in range(W)] for _ in range(H)]
dp[0][0][X[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range(80 * 3 + 1):
if dp[i][j][k] == 0: continue
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
dp[i + 1][j][u] += dp[i][j][k]
dp[i + 1][j][v] += dp[i][j][k]
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
dp[i][j + 1][u] += dp[i][j][k]
dp[i][j + 1][v] += dp[i][j][k]
res = 80
#print(dp[1][1])
for k in range(81):
if dp[-1][-1][k]: res = min(k, res)
print(res) | import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
X = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0].add(X[0][0])
for i in range(H):
for j in range(W):
for k in dp[i][j]:
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
dp[i + 1][j].add(u)
dp[i + 1][j].add(v)
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
dp[i][j + 1].add(u)
dp[i][j + 1].add(v)
res = float("inf")
#print(dp[1][1])
for k in dp[-1][-1]: res = min(k, res)
print(res) | p02839 |
import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
X = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp1 = [set() for _ in range(W)]
dp1[0].add(X[0][0])
dp2 = [set() for _ in range(W)]
for i in range(H):
if i % 2 == 0:
dp2 = [set() for _ in range(W)]
else: dp1 = [set() for _ in range(W)]
for j in range(W):
if i % 2 == 0:
for k in dp1[j]:
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
dp2[j].add(u)
dp2[j].add(v)
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
dp1[j + 1].add(u)
dp1[j + 1].add(v)
else:
for k in dp2[j]:
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
dp1[j].add(u)
dp1[j].add(v)
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
dp2[j + 1].add(u)
dp2[j + 1].add(v)
res = float("inf")
if H % 2:
for k in dp1[-1]: res = min(k, res)
else:
for k in dp2[-1]: res = min(k, res)
print(res) | import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
X = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp1 = [set() for _ in range(W)]
dp1[0].add(X[0][0])
dp2 = [set() for _ in range(W)]
dplimit = [[0] * W for _ in range(H)]
dplimit[-1][-1] = 80
for i in range(H - 1, -1, -1):
for j in range(W - 1, -1, -1):
x = X[i][j]
if i > 0: dplimit[i - 1][j] = max(dplimit[i - 1][j], dplimit[i][j] + x)
if j > 0: dplimit[i][j - 1] = max(dplimit[i][j - 1], dplimit[i][j] + x)
for i in range(H):
if i % 2 == 0:
dp2 = [set() for _ in range(W)]
else: dp1 = [set() for _ in range(W)]
for j in range(W):
if i % 2 == 0:
for k in dp1[j]:
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
if u <= dplimit[i][j]: dp2[j].add(u)
if v <= dplimit[i][j]: dp2[j].add(v)
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
if u <= dplimit[i][j]: dp1[j + 1].add(u)
if v <= dplimit[i][j]: dp1[j + 1].add(v)
else:
for k in dp2[j]:
if i + 1 < H:
u = k + X[i + 1][j]
v = abs(k - X[i + 1][j])
if u <= dplimit[i][j]: dp1[j].add(u)
if v <= dplimit[i][j]: dp1[j].add(v)
if j + 1 < W:
u = k + X[i][j + 1]
v = abs(k - X[i][j + 1])
if u <= dplimit[i][j]: dp2[j + 1].add(u)
if v <= dplimit[i][j]: dp2[j + 1].add(v)
res = float("inf")
if H % 2:
for k in dp1[-1]: res = min(k, res)
else:
for k in dp2[-1]: res = min(k, res)
print(res) | p02839 |
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp = [[[False] * 12801 for j in range(W)] for _ in range(H)]
dp[0][0][C[0][0]] = True
for i in range(H):
for j in range(W):
if i == j == 0:
continue
for n in range(12801):
if i > 0 and dp[i-1][j][n] or j > 0 and dp[i][j-1][n]:
dp[i][j][abs(n-C[i][j])] = True
dp[i][j][abs(n+C[i][j])] = True
for n in range(12801):
if dp[H-1][W-1][n]:
print(n)
break | H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
M = (H+W)*80
dp = [[0] * W for _ in range(H)]
dp[0][0] |= 1 << (M-C[0][0])
for i in range(H):
for j in range(W):
if i == j == 0:
continue
bit = 0
if i > 0:
bit |= dp[i-1][j]
if j > 0:
bit |= dp[i][j-1]
dp[i][j] = (bit >> C[i][j]) | (bit << C[i][j])
ans = M
for i in range(M+1):
if (dp[-1][-1] >> i) & 1:
ans = min(ans, abs(M-i))
print(ans) | p02839 |
import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
can_make = [[None for _ in range(W)] for _ in range(H)]
for i in range(H):
for j in range(W):
x = A[i][j] - B[i][j]
if i == j == 0:
can_make[i][j] = set([abs(x)])
continue
st = set()
if i > 0:
for y in can_make[i-1][j]:
if abs(y + x) <= 6400:
st.add(abs(y + x))
st.add(abs(y - x))
if j > 0:
for y in can_make[i][j-1]:
if abs(y + x) <= 6400:
st.add(abs(y + x))
st.add(abs(y - x))
can_make[i][j] = st
print((min(can_make[-1][-1], key=lambda x: abs(x))))
| import sys
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
can_make = [[None for _ in range(W)] for _ in range(H)]
for i in range(H):
for j in range(W):
x = A[i][j] - B[i][j]
if i == j == 0:
can_make[i][j] = set([abs(x)])
continue
st = set()
ub = 80 * (W - i + H - j)
if i > 0:
for y in can_make[i-1][j]:
if abs(y + x) <= ub:
st.add(abs(y + x))
if abs(y - x) <= ub:
st.add(abs(y - x))
if j > 0:
for y in can_make[i][j-1]:
if abs(y + x) <= ub:
st.add(abs(y + x))
if abs(y - x) <= ub:
st.add(abs(y - x))
can_make[i][j] = st
print((min(can_make[-1][-1], key=lambda x: abs(x))))
| p02839 |
import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
A = []
for i in range(h):
A.append(list(map(int,input().split())))
B = []
for i in range(h):
B.append(list(map(int,input().split())))
l = 160*80 + 1
dp = [[[0]*l for _ in range(w+1)] for _ in range(h+1)]
for i in range(h):
for j in range(w):
d = abs(A[i][j] - B[i][j])
if i == 0 and j == 0:
dp[0][0][d] = 1
for k in range(l):
if k+d < l:
dp[i+1][j][k+d] += dp[i][j][k]
dp[i][j+1][k+d] += dp[i][j][k]
dp[i+1][j][abs(k-d)] += dp[i][j][k]
dp[i][j+1][abs(k-d)] += dp[i][j][k]
for i in range(l+1):
if dp[h][w-1][i] > 0:
print(i)
exit(0)
| import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
A = []
for i in range(h):
A.append(list(map(int,input().split())))
B = []
for i in range(h):
B.append(list(map(int,input().split())))
l = 80*80 + 1
dp = [[[0]*l for _ in range(w+1)] for _ in range(h+1)]
for i in range(h):
for j in range(w):
d = abs(A[i][j] - B[i][j])
if i == 0 and j == 0:
dp[0][0][d] = 1
for k in range(l):
if k+d < l:
dp[i+1][j][k+d] += dp[i][j][k]
dp[i][j+1][k+d] += dp[i][j][k]
dp[i+1][j][abs(k-d)] += dp[i][j][k]
dp[i][j+1][abs(k-d)] += dp[i][j][k]
for i in range(l+1):
if dp[h][w-1][i] > 0:
print(i)
exit(0)
| p02839 |
import sys
def input():
return sys.stdin.readline()[:-1]
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d=[[0 for i in range(w)] for j in range(h)]
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
dp=[[[False for i in range(80*80)] for j in range(w)] for k in range(h)]
dp[0][0][d[0][0]] = True
for i in range(h):
for j in range(w):
for dis in range(80*80):
if dp[i][j][dis]:
if i+1<h:
dp[i+1][j][abs(dis-d[i+1][j])]=True
if dis+d[i+1][j]<80*80:
dp[i+1][j][dis+d[i+1][j]]=True
if j+1<w:
dp[i][j+1][abs(dis-d[i][j+1])]=True
if dis+d[i][j+1]<80*80:
dp[i][j+1][dis+d[i][j+1]]=True
for dis in range(80*80):
if dp[-1][-1][dis]:
print(dis)
break | import sys
def input():
return sys.stdin.readline()[:-1]
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d=[[0 for i in range(w)] for j in range(h)]
maxd=1
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
maxd=max(maxd,d[i][j])
dp=[[0 for j in range(w)] for k in range(h)]
c=20000
dp[0][0] |= 1 << c+d[0][0]
for i in range(h):
for j in range(w):
if i+1<h:
dp[i+1][j] |= dp[i][j] << d[i+1][j]
dp[i+1][j] |= dp[i][j] >> d[i+1][j]
if j+1<w:
dp[i][j+1] |= dp[i][j] << d[i][j+1]
dp[i][j+1] |= dp[i][j] >> d[i][j+1]
m=1000000
cnt = 0
for x in bin(dp[h-1][w-1])[2:][::-1]:
if x=='1':
m=min(m,abs(cnt-c))
cnt+=1
print(m) | p02839 |
H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(H)]
B = [list(map(int,input().split())) for _ in range(H)]
dp = [[[False]*((H+W)*80) for _ in range(W)] for _ in range(H)]
dp[0][0][abs(A[0][0]-B[0][0])] = True
for h in range(H-1):
for w in range(W-1):
v1 = abs(A[h+1][w]-B[h+1][w])
v2 = abs(A[h][w+1]-B[h][w+1])
for v in range((H+W)*80):
if dp[h][w][v]:
dp[h+1][w][v1+v] = True
dp[h+1][w][abs(v1-v)] = True
dp[h][w+1][v2+v] = True
dp[h][w+1][abs(v2-v)] = True
v0 = abs(A[H-1][W-1]-B[H-1][W-1])
for v in range((H+W)*80):
if dp[H-1][W-2][v]:
dp[H-1][W-1][v0+v] = True
dp[H-1][W-1][abs(v0-v)] = True
if dp[H-2][W-1][v]:
dp[H-1][W-1][v0+v] = True
dp[H-1][W-1][abs(v0-v)] = True
for v in range((H+W)*80):
if dp[H-1][W-1][v]:
ans = v
break
print(ans) | H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(H)]
B = [list(map(int,input().split())) for _ in range(H)]
dp1 = [[False]*((H+W)*80) for _ in range(W)]
dp2 = [[False]*((H+W)*80) for _ in range(W)]
for w in range(W):
dp1[w][0] = True
for h in range(H):
for w in range(W):
va = A[h][w]
vb = B[h][w]
for v in range((H+W)*80):
if dp1[w][v]:
dp2[w][abs(v+va-vb)] = True
dp2[w][abs(v-va+vb)] = True
if w!=0:
for v in range((H+W)*80):
if dp2[w-1][v]:
dp2[w][abs(v+va-vb)] = True
dp2[w][abs(v-va+vb)] = True
dp1 = dp2
dp2 = [[False]*((H+W)*80) for _ in range(W)]
for v in range((H+W)*80):
if dp1[W-1][v]:
ans = v
break
print(ans) | p02839 |
h, w= list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(h)]
B = [list(map(int, input().split())) for _ in range(h)]
C = [[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
C[i][j] = abs(A[i][j]-B[i][j])
D = 80*160
dp = [[[0]*D for i in range(w)] for j in range(h)]
dp[0][0][C[0][0]] = 1
for i in range(h):
for j in range(w):
if i+1< h:
for k in range(D):
if dp[i][j][k] != 0:
dp[i+1][j][k+C[i+1][j]] = 1
dp[i+1][j][abs(k-C[i+1][j])] = 1
if j+1<w:
for k in range(D):
if dp[i][j][k] != 0:
dp[i][j+1][k+C[i][j+1]] = 1
dp[i][j+1][abs(k-C[i][j+1])] = 1
for i in range(D):
if dp[-1][-1][i] != 0:
print(i)
exit() | h, w= list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(h)]
B = [list(map(int, input().split())) for _ in range(h)]
C = [[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
C[i][j] = abs(A[i][j]-B[i][j])
D = 80*80
dp = [[[0]*D for i in range(w)] for j in range(h)]
dp[0][0][C[0][0]] = 1
for i in range(h):
for j in range(w):
if i+1< h:
for k in range(D):
if dp[i][j][k] != 0:
if k+C[i+1][j] < D:
dp[i+1][j][k+C[i+1][j]] = 1
dp[i+1][j][abs(k-C[i+1][j])] = 1
if j+1<w:
for k in range(D):
if dp[i][j][k] != 0:
if k+C[i][j+1] < D:
dp[i][j+1][k+C[i][j+1]] = 1
dp[i][j+1][abs(k-C[i][j+1])] = 1
for i in range(D):
if dp[-1][-1][i] != 0:
print(i)
exit() | p02839 |
h,w = list(map(int,input().split()))
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lst = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst[0][0].add(grid[0][0])
for j in range(1,w):
for x in lst[0][j-1]:
lst[0][j].add(abs(grid[0][j]-x))
if grid[0][j] + x <= 6400:
lst[0][j].add(grid[0][j]+x)
for i in range(1,h):
for x in lst[i-1][0]:
lst[i][0].add(abs(grid[i][0]-x))
if grid[i][0] + x <= 6400:
lst[i][0].add(grid[i][0]+x)
for i in range(1,h):
for j in range(1,w):
for x in lst[i][j-1]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
for x in lst[i-1][j]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
print((min(lst[h-1][w-1]))) | import time
t1 = time.time()
h,w = list(map(int,input().split()))
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lst = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst[0][0].add(grid[0][0])
for j in range(1,w):
for x in lst[0][j-1]:
lst[0][j].add(abs(grid[0][j]-x))
if (grid[0][j] + x) <= 6400:
lst[0][j].add(grid[0][j]+x)
for i in range(1,h):
for x in lst[i-1][0]:
lst[i][0].add(abs(grid[i][0]-x))
if grid[i][0] + x <= 6400:
lst[i][0].add(grid[i][0]+x)
for i in range(1,h):
for j in range(1,w):
for x in lst[i][j-1]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
for x in lst[i-1][j]:
lst[i][j].add(abs(grid[i][j]-x))
if grid[i][j] + x <= 6400:
lst[i][j].add(grid[i][j]+x)
t = time.time()
if t - t1 > 1.8:
print((0))
exit()
print((min(lst[h-1][w-1])))
| p02839 |
H,W = list(map(int,input().split()))
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 20000
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a = A[i][j+1]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i][j+1][k+a] = 1
j = 0
for i in range(H-1):
a = A[i+1][j]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j][k+a] = 1
for i in range(H-1):
for j in range(W-1):
a = A[i+1][j+1]
for k in range(NUM):
if DP[i+1][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
if DP[i][j+1][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
print((DP[-1][-1].index(1))) | H,W = list(map(int,input().split()))
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 10000
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a = A[i][j+1]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i][j+1][k+a] = 1
j = 0
for i in range(H-1):
a = A[i+1][j]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j][k+a] = 1
for i in range(H-1):
for j in range(W-1):
a = A[i+1][j+1]
for k in range(NUM):
if DP[i+1][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
if DP[i][j+1][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
print((DP[-1][-1].index(1))) | p02839 |
H,W = list(map(int,input().split()))
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 10000
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a = A[i][j+1]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i][j+1][k+a] = 1
j = 0
for i in range(H-1):
a = A[i+1][j]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j][k+a] = 1
for i in range(H-1):
for j in range(W-1):
a = A[i+1][j+1]
for k in range(NUM):
if DP[i+1][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
if DP[i][j+1][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
print((DP[-1][-1].index(1))) | H,W = list(map(int,input().split()))
A = [list(map(int,input().split()))for _ in range(H)]
for i in range(H):
b = list(map(int,input().split()))
for j in range(W):
A[i][j] = abs(A[i][j]-b[j])
NUM = 6400
DP = [[[0]*NUM for i in range(W)]for j in range(H)]
DP[0][0][A[0][0]] = 1
i = 0
for j in range(W-1):
a = A[i][j+1]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i][j+1][k+a] = 1
j = 0
for i in range(H-1):
a = A[i+1][j]
for k in range(NUM):
if DP[i][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j][k+a] = 1
for i in range(H-1):
for j in range(W-1):
a = A[i+1][j+1]
for k in range(NUM):
if DP[i+1][j][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
if DP[i][j+1][k] == 1:
if 0 <= a-k < NUM:
DP[i+1][j+1][a-k] = 1
if 0 <= k-a < NUM:
DP[i+1][j+1][k-a] = 1
if 0 <= k+a < NUM:
DP[i+1][j+1][k+a] = 1
print((DP[-1][-1].index(1))) | p02839 |
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
dp=[[set() for j in range(w)]for i in range(h)]
sub=a[0][0]-b[0][0]
dp[0][0].add(sub)
dp[0][0].add(-sub)
for c in range(h):
for l in range(w):
sub=a[c][l]-b[c][l]
if c!=0:
for p in dp[c-1][l]:
dp[c][l].add(p+sub)
dp[c][l].add(p-sub)
if l!=0:
for p in dp[c][l-1]:
dp[c][l].add(p+sub)
dp[c][l].add(p-sub)
st=dp[-1][-1]
for i in range(1000000):
if (i in st)or(-i in st):
print(i)
break | h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
pos = 160*80
dp=[[0]*w for i in range(h)]
sub=abs(a[0][0]-b[0][0])
dp[0][0]=1<<(pos-sub)
dp[0][0]=1<<(pos+sub)
for c in range(h):
for l in range(w):
sub=abs(a[c][l]-b[c][l])
if l!=0:
dp[c][l]|=dp[c][l-1]<<sub
dp[c][l]|=dp[c][l-1]>>sub
if c!=0:
dp[c][l]|=dp[c-1][l]<<sub
dp[c][l]|=dp[c-1][l]>>sub
bit=dp[-1][-1]
for i in range(pos):
if (bit&1<<(pos+i))or(bit&1<<(pos-i)):
print(i)
break | p02839 |
h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
pos = 160*80
dp=[[0]*w for i in range(h)]
sub=abs(a[0][0]-b[0][0])
dp[0][0]=1<<(pos-sub)
dp[0][0]=1<<(pos+sub)
for c in range(h):
for l in range(w):
sub=abs(a[c][l]-b[c][l])
if l!=0:
dp[c][l]|=dp[c][l-1]<<sub
dp[c][l]|=dp[c][l-1]>>sub
if c!=0:
dp[c][l]|=dp[c-1][l]<<sub
dp[c][l]|=dp[c-1][l]>>sub
bit=dp[-1][-1]
for i in range(pos):
if (bit&1<<(pos+i))or(bit&1<<(pos-i)):
print(i)
break | h,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
pos = 160*80
dp=[[0]*w for i in range(h)]
sub=abs(a[0][0]-b[0][0])
dp[0][0]=1<<(pos-sub)|1<<(pos+sub)
for c in range(h):
for l in range(w):
sub=abs(a[c][l]-b[c][l])
if l!=0 and c!=0:
dp[c][l]|=dp[c][l-1]<<sub|dp[c][l-1]>>sub|dp[c-1][l]<<sub|dp[c-1][l]>>sub
elif c!=0:
dp[c][l]|=dp[c-1][l]<<sub|dp[c-1][l]>>sub
elif l!=0:
dp[c][l]|=dp[c][l-1]<<sub|dp[c][l-1]>>sub
bit=dp[-1][-1]
for i in range(pos):
if (bit&1<<(pos+i))or(bit&1<<(pos-i)):
print(i)
break | p02839 |
import sys
input = sys.stdin.readline
h,w=list(map(int,input().split()))
a=[]
for i in range(h):
a.append(list(map(int,input().split())))
b=[]
for i in range(h):
b.append(list(map(int,input().split())))
dp=[[set([]) for i in range(w)] for j in range(h)]
dp[0][0].add(a[0][0]-b[0][0])
dp[0][0].add(b[0][0]-a[0][0])
for i in range(h):
for j in range(w):
if i==j==0:
continue
if i==0:
for k in dp[i][j-1]:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
elif j==0:
for k in dp[i-1][j]:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
else:
for k in (dp[i][j-1]|dp[i-1][j]):
if k<=6400:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
#dp[h-1][w-1]
ans=10**10
for i in dp[h-1][w-1]:
ans=min(ans,abs(i))
print(ans)
| import sys
input = sys.stdin.readline
h,w=list(map(int,input().split()))
a=[]
for i in range(h):
a.append(list(map(int,input().split())))
b=[]
for i in range(h):
b.append(list(map(int,input().split())))
dp=[[set([]) for i in range(w)] for j in range(h)]
dp[0][0].add(a[0][0]-b[0][0])
dp[0][0].add(b[0][0]-a[0][0])
for i in range(h):
for j in range(w):
if i==j==0:
continue
if i==0:
for k in dp[i][j-1]:
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
elif j==0:
for k in dp[i-1][j]:
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
else:
for k in (dp[i][j-1]|dp[i-1][j]):
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
#dp[h-1][w-1]
ans=10**10
for i in dp[h-1][w-1]:
ans=min(ans,abs(i))
print(ans)
| p02839 |
import sys
input = sys.stdin.readline
h,w=list(map(int,input().split()))
a=[]
for i in range(h):
a.append(list(map(int,input().split())))
b=[]
for i in range(h):
b.append(list(map(int,input().split())))
dp=[[set([]) for i in range(w)] for j in range(h)]
dp[0][0].add(a[0][0]-b[0][0])
dp[0][0].add(b[0][0]-a[0][0])
for i in range(h):
for j in range(w):
if i==j==0:
continue
if i==0:
for k in dp[i][j-1]:
if k<=4000:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
elif j==0:
for k in dp[i-1][j]:
if k<=4000:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
else:
for k in (dp[i][j-1]|dp[i-1][j]):
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
#dp[h-1][w-1]
ans=10**10
for i in dp[h-1][w-1]:
ans=min(ans,abs(i))
print(ans)
| import sys
input = sys.stdin.readline
h,w=list(map(int,input().split()))
a=[]
for i in range(h):
a.append(list(map(int,input().split())))
b=[]
for i in range(h):
b.append(list(map(int,input().split())))
dp=[[set([]) for i in range(w)] for j in range(h)]
dp[0][0].add(a[0][0]-b[0][0])
dp[0][0].add(b[0][0]-a[0][0])
for i in range(h):
for j in range(w):
if i==j==0:
continue
if i==0:
for k in dp[i][j-1]:
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
elif j==0:
for k in dp[i-1][j]:
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
else:
for k in (dp[i][j-1]|dp[i-1][j]):
if k<=6500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
#dp[h-1][w-1]
ans=10**10
for i in dp[h-1][w-1]:
ans=min(ans,abs(i))
print(ans)
| p02839 |
import sys
input = sys.stdin.readline
h,w=list(map(int,input().split()))
a=[]
for i in range(h):
a.append(list(map(int,input().split())))
b=[]
for i in range(h):
b.append(list(map(int,input().split())))
dp=[[set([]) for i in range(w)] for j in range(h)]
dp[0][0].add(a[0][0]-b[0][0])
dp[0][0].add(b[0][0]-a[0][0])
for i in range(h):
for j in range(w):
if i==j==0:
continue
if i==0:
for k in dp[i][j-1]:
if k<=3550:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
elif j==0:
for k in dp[i-1][j]:
if k<=3550:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
else:
for k in (dp[i][j-1]|dp[i-1][j]):
if k<=5500:
dp[i][j].add(abs(k+a[i][j]-b[i][j]))
dp[i][j].add(abs(k+b[i][j]-a[i][j]))
#dp[h-1][w-1]
ans=10**10
for i in dp[h-1][w-1]:
ans=min(ans,abs(i))
print(ans)
| import sys
input = sys.stdin.readline
H,W=list(map(int,input().split()))
a = [[] for _ in range(H)]
for i in range(H):
a[i] = list(map(int, input().split()))
b = [[] for _ in range(H)]
for i in range(H):
b[i] = list(map(int, input().split()))
for i in range(H):
for j in range(W):
a[i][j] =abs(a[i][j]-b[i][j])
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0].add(a[0][0])
for i in range(1,H):
t = a[i][0]
tmp = set()
for k in dp[i-1][0]:
tmp.add(k+t)
tmp.add(abs(k-t))
dp[i][0] = tmp
for j in range(1,W):
t = a[0][j]
tmp = set()
for k in dp[0][j-1]:
tmp.add(k+t)
tmp.add(abs(k-t))
dp[0][j] = tmp
for i in range(1,H):
for j in range(1,W):
t = a[i][j]
tmp = set()
for k in (dp[i-1][j] | dp[i][j-1]):
tmp.add(k+t)
tmp.add(abs(k-t))
dp[i][j] = tmp
dp[i-1][j-1] = set()
ls = list(dp[H-1][W-1])
print((min(ls)))
| p02839 |
import sys
input=sys.stdin.readline
h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for _ in range(h)]
b=[list(map(int,input().split()))for _ in range(h)]
l=80*80+1
dp=[l*[False]for _ in range((h+1)*(w+1))]
mid=l//2
for i in range(h):
for j in range(w):
c=abs(a[i][j]-b[i][j])
if i==j==0:dp[w+2][c]=True;continue
else:
for k in range(l-c):dp[(i+1)*(w+1)+j+1][k]=dp[i*(w+1)+j+1][abs(k-c)] or dp[(i+1)*(w+1)+j][abs(k-c)] or dp[i*(w+1)+j+1][abs(k+c)] or dp[(i+1)*(w+1)+j][abs(k+c)]
for i in range(l):
if dp[-1][i]:print(i);exit() | h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for _ in range(h)]
b=[list(map(int,input().split()))for _ in range(h)]
d=[[a[i][j]-b[i][j]for j in range(w)]for i in range(h)]
dp=[w*[0]for _ in range(h)]
dp[0][0]=1<<(80+d[0][0])|1<<(80-d[0][0])
for i in range(h):
for j in range(w):
if i!=0:
dp[i][j]|=(dp[i-1][j]<<80+d[i][j])
dp[i][j]|=(dp[i-1][j]<<80-d[i][j])
if j!=0:
dp[i][j]|=(dp[i][j-1]<<80+d[i][j])
dp[i][j]|=(dp[i][j-1]<<80-d[i][j])
n=dp[-1][-1]|(1<<15000)
ans=1<<1000
for i in range(15000):
if n&(1<<i):ans=min(ans,abs(i-(h+w-1)*80))
print(ans) | p02839 |
h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for _ in range(h)]
b=[list(map(int,input().split()))for _ in range(h)]
c=[[abs(a[i][j]-b[i][j]) for j in range(w)]for i in range(h)]
dp=[[[False]*25601 for _ in range(w+1)]for _ in range(h+1)]
dp[0][1][12800]=True
for i in range(1,h+1):
for j in range(1,w+1):
t=c[i-1][j-1]
for k in range(25601):
if t<=k:dp[i][j][k]|=dp[i-1][j][k-t]|dp[i][j-1][k-t]
if 25600>=t+k:dp[i][j][k]|=dp[i-1][j][k+t]|dp[i][j-1][k+t]
ans=10**20
for i in range(25601):
if dp[h][w][i]:
ans=min(ans,abs(12800-i))
print(ans)
| h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for _ in range(h)]
b=[list(map(int,input().split()))for _ in range(h)]
c=[[abs(a[i][j]-b[i][j]) for j in range(w)]for i in range(h)]
dp=[[0]*(w+1)for _ in range(h+1)]
dp[0][1]=1<<12800
for i in range(1,h+1):
for j in range(1,w+1):
t=c[i-1][j-1]
dp[i][j]=(dp[i][j-1]<<t)|(dp[i][j-1]>>t)|(dp[i-1][j]<<t)|(dp[i-1][j]>>t)
ans=10**20
for i in range(25601):
if dp[h][w]&(1<<i):
ans=min(ans,abs(12800-i))
print(ans)
| p02839 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
h, w = list(map(int, readline().split()))
a = [list(map(int, readline().split())) for _ in range(h)]
b = [list(map(int, readline().split())) for _ in range(h)]
diff = [[abs(an - bn) for an, bn in zip(arow, brow)] for arow, brow in zip(a, b)]
dp = [[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(diff[0][0])
from itertools import product
for row, col in product(list(range(h)),list(range(w))):
curset = set()
prevset = set()
curdiff = diff[row][col]
if row - 1 >= 0:
prevset |= dp[row - 1][col]
if col - 1 >= 0:
prevset |= dp[row][col - 1]
for num in prevset:
curset.add(num + curdiff)
curset.add(abs(num - curdiff))
dp[row][col] |= curset
cand = list(dp[h - 1][w - 1])
print((min(cand)))
if __name__ == '__main__':
main()
| import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
h, w = list(map(int, readline().split()))
a = [list(map(int, readline().split())) for _ in range(h)]
b = [list(map(int, readline().split())) for _ in range(h)]
diff = [[abs(an - bn) for an, bn in zip(arow, brow)] for arow, brow in zip(a, b)]
dp = [[1 << (80 * 160 + 1) for _ in range(w)] for _ in range(h)]
dp[0][0] |= 1 << diff[0][0]
from itertools import product
for row, col in product(list(range(h)), list(range(w))):
diff_cur = diff[row][col]
prevset = 0
if row - 1 >= 0:
prevset |= dp[row - 1][col]
if col - 1 >= 0:
prevset |= dp[row][col - 1]
dp[row][col] |= (prevset << diff_cur)
dp[row][col] |= (prevset >> diff_cur)
temp = 0
for i in range(diff_cur):
if prevset >> i & 1:
temp += (1 << diff_cur - i)
dp[row][col] |= temp
for i in range(12801):
if dp[h - 1][w - 1] >> i & 1:
print(i)
sys.exit()
if __name__ == '__main__':
main()
| p02839 |
H, W = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
D = 80 * (H + W) + 1
D2 = D * 2
dp = [[0] * W for _ in range(H)]
dp[0][0] |= 1 << (D + C[0][0])
dp[0][0] != 1 << (D - C[0][0])
for h in range(H):
for w in range(W):
tmp = C[h][w]
if h:
dp[h][w] |= dp[h - 1][w] << tmp
dp[h][w] |= dp[h - 1][w] >> tmp
if w:
dp[h][w] |= dp[h][w - 1] << tmp
dp[h][w] |= dp[h][w - 1] >> tmp
ans = D2
tmp = dp[H - 1][W - 1]
for i in range(D2):
if (tmp >> i) & 1:
ans = min(ans, abs(i - D))
print (ans) | H, W = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
D = 80 * (H + W) + 1
D2 = D * 2
dp = [[0] * W for _ in range(H)]
dp[0][0] |= 1 << (D + C[0][0])
dp[0][0] |= 1 << (D - C[0][0])
for h in range(H):
for w in range(W):
c = C[h][w]
if h >= 1:
dp[h][w] |= dp[h - 1][w] << c
dp[h][w] |= dp[h - 1][w] >> c
if w >= 1:
dp[h][w] |= dp[h][w - 1] << c
dp[h][w] |= dp[h][w - 1] >> c
ans = D2
tmp = dp[H - 1][W - 1]
for i in range(D2):
if (tmp >> i) & 1:
ans = min(ans, abs(i - D))
print (ans) | p02839 |
# -*- coding: utf-8 -*-
# E
# dp[[i][j]で、(i,j)で可能な偏りをリストとして格納していく
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
H, W = list(map(int, input().split()))
a = []
x = []
for i in range(H):
a.append(list(map(int, input().split())))
for i in range(H):
x.append(list(map(int, input().split())))
for j in range(W):
x[i][j] = abs(x[i][j] - a[i][j])
dp = [[set([]) for _ in range(W)] for _ in range(H)]
dp[0][0].add(x[0][0])
for i in range(H):
for j in range(W):
if i > 0:
for num in dp[i-1][j]:
dp[i][j].add(num + x[i][j])
dp[i][j].add(abs(num - x[i][j]))
if j > 0:
for num in dp[i][j-1]:
dp[i][j].add(num + x[i][j])
dp[i][j].add(abs(num - x[i][j]))
# print(dp)
print((min(dp[H-1][W-1])))
| # -*- coding: utf-8 -*-
# E: bit演算を活用して効率的に計算しないとTLEになる
# dp[[i][j]で、(i,j)で可能な偏りを格納していく
# 1, 2, 3が可能な場合は"00000111"と表現する
# n + m を可能にするには、n << mにすれば良い
# (1, 2, 3)に2を足して(3, 4, 5)を可能にするなら、
# "00011100"としたいので、n << mで良い
# (3, 4, 5)に±4する場合；
# 求めたいのは(7, 8, 9) | (-1, 0, 1)
# −１を1としたい
import sys
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
H, W = list(map(int, input().split()))
a = []
x = []
for i in range(H):
a.append(list(map(int, input().split())))
for i in range(H):
x.append(list(map(int, input().split())))
for j in range(W):
x[i][j] = abs(x[i][j] - a[i][j])
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1 << x[0][0]
# print(bin(dp[0][0]))
def reverse(d, x):
res = 0
for i in range(x+1):
res <<= 1
if (1<<i) & d:
res |= 1
return res
for i in range(H):
for j in range(W):
g = x[i][j]
if i > 0:
d1 = dp[i-1][j]
dp[i][j] |= d1 << g | d1 >> g | reverse(d1, g)
if j > 0:
d2 = dp[i][j-1]
dp[i][j] |= d2 << g | d2 >> g | reverse(d2, g)
a = dp[H-1][W-1]
for i in range(a.bit_length()):
if a >> i & 1 == 1:
print(i)
sys.exit()
| p02839 |
import sys
input = sys.stdin.readline
def main():
h,w = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(h)]
b = [list(map(int,input().split())) for i in range(h)]
dp = [[[False]*4000 for j in range(w)] for i in range(h)]
dp[0][0][2000+a[0][0]-b[0][0]] = True
dp[0][0][2000-a[0][0]+b[0][0]] = True
for i in range(1,h):
for k in range(4000):
if 0 <= k+a[i][0]-b[i][0] <= 3999 and dp[i-1][0][k+a[i][0]-b[i][0]]:
dp[i][0][k] = True
elif 0 <= k-a[i][0]+b[i][0] <= 3999 and dp[i-1][0][k-a[i][0]+b[i][0]]:
dp[i][0][k] = True
for j in range(1,w):
for k in range(4000):
if 0 <= k+a[0][j]-b[0][j] <= 3999 and dp[0][j-1][k+a[0][j]-b[0][j]]:
dp[0][j][k] = True
elif 0 <= k-a[0][j]+b[0][j] <= 3999 and dp[0][j-1][k-a[0][j]+b[0][j]]:
dp[0][j][k] = True
for i in range(1,h):
for j in range(1,w):
for k in range(4000):
if 0 <= k+a[i][j]-b[i][j] <= 3999 and dp[i-1][j][k+a[i][j]-b[i][j]]:
dp[i][j][k] = True
elif 0 <= k+a[i][j]-b[i][j] <= 3999 and dp[i][j-1][k+a[i][j]-b[i][j]]:
dp[i][j][k] = True
elif 0 <= k-a[i][j]+b[i][j] <= 3999 and dp[i-1][j][k-a[i][j]+b[i][j]]:
dp[i][j][k] = True
elif 0 <= k-a[i][j]+b[i][j] <= 3999 and dp[i][j-1][k-a[i][j]+b[i][j]]:
dp[i][j][k] = True
res = 10**9
for k in range(4000):
if dp[-1][-1][k]:
res = min(res,abs(2000-k))
print(res)
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
h,w =list(map(int,input().split()))
a = [tuple(map(int,input().split())) for _ in [0]*h]
b = [tuple(map(int,input().split())) for _ in [0]*h]
mid = 1<<(80*160)
dp = [[0]*w for _ in [0]*h]
for i in range(h):
for j in range(w):
diff = abs(a[i][j]-b[i][j])
new = 0
if i > 0:
new |= dp[i-1][j]
if j > 0:
new |= dp[i][j-1]
if (i,j) == (0,0):
new = mid
dp[i][j] = (new<<diff)|(new>>diff)
res = 10**9
p = dp[-1][-1]
for i in range(80*321):
if p&1 == 1:
res = min(res,abs(80*160-i))
p = p>> 1
print(res) | p02839 |
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[] for _ in range(H)]
for i in range(H):
for j in range(W):
C[i].append(abs(A[i][j] - B[i][j]))
#print(C)
dp = [[[0 for _ in range((H + W) * 80 + 1)] for _ in range(W)] for _ in range(H)]
#print(dp)
dp[0][0][C[0][0]] = 1
for i in range(H):
for j in range(W):
for k in range((H+W)*80+1):
if dp[i-1][j][k]:
dp[i][j][k + C[i][j]] = 1
dp[i][j][abs(k - C[i][j])] = 1
if dp[i][j-1][k]:
dp[i][j][k + C[i][j]] = 1
dp[i][j][abs(k - C[i][j])] = 1
for i in range((H+W)*80+1):
if dp[H-1][W-1][i]:
print(i)
exit() | H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
dp = [[0 for _ in range(W)] for _ in range(H)]
SIZE = 20000
D = abs(A[0][0] - B[0][0])
dp[0][0] = 1 << SIZE - D | 1 << SIZE + D
#print("dp:", dp)
for i in range(H):
for j in range(W):
D = abs(A[i][j] - B[i][j])
dp[i][j] |= dp[i - 1][j] << D | dp[i - 1][j] >> D
dp[i][j] |= dp[i][j - 1] << D | dp[i][j - 1] >> D
#for i in range(H):
# a = list(map(lambda x: bin(x)[2::], dp[i]))
# print(a)
for i in range(SIZE):
if (dp[-1][-1] >> (SIZE + i)) & 1:
print(i)
exit() | p02839 |
from collections import deque
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = A[i][j]-B[i][j]
M = 80*(H+W)
dp = [[[0]*(M*2+10) for i in range(W)] for j in range(H)]
dp[0][0][0] = 1
que = deque([(0, 0)])
while que:
a, b = que.pop()
c = C[a][b]
if a<=H-2:
for i in range(-M+c, M+1-c):
if dp[a][b][i]:
dp[a+1][b][i+c] = 1
dp[a+1][b][i-c] = 1
que.append((a+1, b))
if b<=W-2:
for i in range(-M+c, M+1-c):
if dp[a][b][i]:
dp[a][b+1][i+c] = 1
dp[a][b-1][i-c] = 1
que.append((a, b+1))
c = C[-1][-1]
ans = 10**10
for i in range(-M, M+1):
if dp[-1][-1][i]:
ans = min(ans, abs(i+c), abs(i-c))
print(ans)
| from collections import deque
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = A[i][j]-B[i][j]
M = 80*(H+W)
dp = [[set() for i in range(W)] for j in range(H)]
c = C[0][0]
dp[0][0].add(c)
dp[0][0].add(-c)
for s in range(1, H+W):
for b in range(W):
a = s-b
if a<0 or a>=H:
continue
c = C[a][b]
if a>=1:
for i in dp[a-1][b]:
dp[a][b].add(i+c)
dp[a][b].add(i-c)
if b>=1:
for i in dp[a][b-1]:
dp[a][b].add(i+c)
dp[a][b].add(i-c)
ans = min(abs(i) for i in dp[-1][-1])
print(ans)
| p02839 |
from collections import deque
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = A[i][j]-B[i][j]
M = 80*(H+W)
dp = [set() for j in range(H)]
c = C[0][0]
dp[0].add(c)
dp[0].add(-c)
for i in range(1, H):
c = C[i][0]
for j in dp[i-1]:
dp[i].add(j+c)
dp[i].add(j-c)
for i in range(1, W):
dp1 = [set() for j in range(H)]
c = C[0][i]
for k in dp[0]:
dp1[0].add(k+c)
dp1[0].add(k-c)
for j in range(1, H):
c = C[j][i]
for k in dp[j]:
dp1[j].add(k+c)
dp1[j].add(k-c)
for k in dp1[j-1]:
dp1[j].add(k+c)
dp1[j].add(k-c)
dp = dp1
ans = min(abs(i) for i in dp[-1])
print(ans)
| from collections import deque
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
C = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
M = 80*(H+W)
dp = [[0 for i in range(W)] for j in range(H)]
c = C[0][0]
dp[0][0]+=(1<<(c+M))|(1<<(M-c))
for s in range(1, H+W):
for b in range(max(s-H+1, 0), min(s+1, W)):
a = s-b
c = C[a][b]
if a>=1:
d = dp[a-1][b]
dp[a][b]|=(d<<c)|(d>>c)
if b>=1:
d = dp[a][b-1]
dp[a][b]|=(d<<c)|(d>>c)
ans = 10**10
d = dp[-1][-1]
for i in range(0, M*2+1):
if 1<<i&d:
ans = min(ans, abs(i-M))
print(ans)
| p02839 |
import sys
def main():
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = []
B = []
M = 80 * (H + W)
for _ in range(H):
a = tuple(map(int, input().split()))
A.append(a)
for _ in range(H):
b = tuple(map(int, input().split()))
B.append(b)
AB = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
AB[i][j] = abs(A[i][j] - B[i][j])
l = [[set([]) for _ in range(M) for _ in range(W)] for _ in range(H)]
for i in range(H):
for j in range(W):
if i == 0 and j == 0:
l[i][j].add(AB[0][0])
else:
t = AB[i][j]
if i > 0:
for k in l[i-1][j]:
l[i][j].add(k+t)
l[i][j].add(abs(k-t))
if j > 0:
for k in l[i][j-1]:
l[i][j].add(k+t)
l[i][j].add(abs(k-t))
return min(l[i][j])
print((main()))
| import sys
def main():
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = []
B = []
M = 80 * (H + W)
for _ in range(H):
a = tuple(map(int, input().split()))
A.append(a)
for _ in range(H):
b = tuple(map(int, input().split()))
B.append(b)
AB = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
AB[i][j] = abs(A[i][j] - B[i][j])
l = [set([]) for _ in range(W)]
lt = [set([]) for _ in range(W)]
for i in range(H):
for j in range(W):
if i == 0 and j == 0:
lt[j].add(AB[0][0])
else:
t = AB[i][j]
if i > 0:
for k in l[j]:
lt[j].add(k+t)
lt[j].add(abs(k-t))
if j > 0:
for k in lt[j-1]:
lt[j].add(k+t)
lt[j].add(abs(k-t))
l = lt
lt = [set([]) for _ in range(W)]
return min(l[-1])
print((main()))
| p02839 |
import sys
input = sys.stdin.readline
h, w = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(h)]
B = [list(map(int,input().split())) for i in range(h)]
C = [[0] * w for i in range(h)]
for i in range(h):
for j in range(w):
C[i][j] = abs(A[i][j]-B[i][j])
V = [[2] * w for i in range(h)]
for i in range(h):
V[i][0] -= 1
for i in range(w):
V[0][i] -= 1
l = 7000
m = 0
M = [[[0] * l for i in range(w)] for j in range(h)]
N = [[0 for i in range(w)] for j in range(h)]
N[0][0] = C[0][0]
s = 0
Q = []
for i in range(h):
Q.append([i, 0])
for i in range(1, w):
Q.append([0, i])
for i in range(1, h):
for j in range(1, w):
Q.append([i, j])
M[0][0][C[0][0]] = 1
# M[0][0][m-C[0][0]] = 1
for s in range(len(Q)):
i = Q[s][0]
j = Q[s][1]
if i+1 < h:
for ii in range(min(N[i][j]+1, l)):
if M[i][j][ii] == 1:
if abs(ii+C[i+1][j]) < l:
M[i+1][j][abs(ii+C[i+1][j])] = 1
if abs(ii-C[i+1][j]) < l:
M[i+1][j][abs(ii-C[i+1][j])] = 1
N[i+1][j] = max(N[i+1][j], N[i][j] + C[i+1][j])
if j+1 < w:
for ii in range(min(N[i][j]+1, l)):
if M[i][j][ii] == 1:
if abs(ii+C[i][j+1]) < l:
M[i][j+1][abs(ii+C[i][j+1])] = 1
if abs(ii-C[i][j+1]) < l:
M[i][j+1][abs(ii-C[i][j+1])] = 1
N[i][j+1] = max(N[i][j+1], N[i][j] + C[i][j+1])
# print(M[-1][-1])
ans = 10**5
for i in range(len(M[-1][-1])):
if M[-1][-1][i] == 1:
ans = i
break
print(ans) | import sys
input = sys.stdin.readline
h, w = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(h)]
B = [list(map(int,input().split())) for i in range(h)]
C = [[0] * w for i in range(h)]
for i in range(h):
for j in range(w):
C[i][j] = abs(A[i][j]-B[i][j])
M = [[0] * w for i in range(h)]
s = 0
Q = []
for i in range(h):
Q.append([i, 0])
for i in range(1, w):
Q.append([0, i])
for i in range(1, h):
for j in range(1, w):
Q.append([i, j])
m = 80
M[0][0] = (1 << m + C[0][0]) | (1 << m - C[0][0])
for s in range(len(Q)):
i = Q[s][0]
j = Q[s][1]
if i+1 < h:
M[i+1][j] |= (M[i][j] << m + C[i+1][j]) | (M[i][j] << m - C[i+1][j])
if j+1 < w:
M[i][j+1] |= (M[i][j] << m + C[i][j+1]) | (M[i][j] << m - C[i][j+1])
# N[i][j+1] = max(N[i][j+1], N[i][j] + C[i][j+1])
# print(M[-1][-1])
b = bin(M[-1][-1])
ans = float("inf")
for i in range(len(b)):
if b[-1-i] == "1":
ans = min(ans, abs(i - m*(h+w-1)))
print(ans) | p02839 |
h, w = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(h)]
B = [list(map(int, input().split())) for _ in range(h)]
grid = [[0] * w for _ in range(h)]
for i in range(h):
for j in range(w):
m = abs(A[i][j] - B[i][j])
grid[i][j] = m
bias_inf = 2000
dp = [[[0 for i in range(-bias_inf,bias_inf)] for j in range(w)] for k in range(h)]
dp[0][0][0 - grid[0][0]] = 1
dp[0][0][0 + grid[0][0]] = 1
for i in range(h):
for j in range(w):
for k in range(-bias_inf,bias_inf):
if i == h-1 and j == w-1:
break
if dp[i][j][k]:
if i != h-1 and j != w-1:
dp[i][j+1][k + grid[i][j+1]] = 1
dp[i+1][j][k + grid[i+1][j]] = 1
dp[i][j+1][k - grid[i][j+1]] = 1
dp[i+1][j][k - grid[i+1][j]] = 1
elif j == w-1:
dp[i+1][j][k - grid[i+1][j]] = 1
dp[i+1][j][k + grid[i+1][j]] = 1
else:
dp[i][j+1][k - grid[i][j+1]] = 1
dp[i][j+1][k + grid[i][j+1]] = 1
ans = bias_inf
for i in range(-bias_inf,bias_inf):
if dp[-1][-1][i]:
ans = min(ans, abs(i))
print(ans) | def solve(h, w, A, B):
center = 80 * (h + w - 1)
C = [[abs(A[r][c] - B[r][c]) for c in range(w)] for r in range(h)]
dp = [[0] * w for r in range(h)]
dp[0][0] = (1 << (center + C[0][0])) | (1 << (center - C[0][0]))
for r in range(h):
for c in range(w):
if r > 0:
dp[r][c] |= (dp[r-1][c] << C[r][c]) | (dp[r-1][c] >> C[r][c])
if c > 0:
dp[r][c] |= (dp[r][c-1] << C[r][c]) | (dp[r][c-1] >> C[r][c])
mask = bin(dp[-1][-1] >> center)
return mask[::-1].find("1")
h, w = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(h)]
B = [list(map(int, input().split())) for i in range(h)]
print((solve(h, w, A, B)))
| p02839 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(H, W, A, B):
M = [[a-b for a, b in zip(ar, br)] for ar, br in zip(A, B)]
dp = [[set() for _ in range(W)] for __ in range(H)]
dp[0][0].add(M[0][0])
for i in range(H):
for j in range(W):
for k, l in [(-1, 0), (0, -1)]:
for v in dp[i+k][j+l]:
dp[i][j].add(abs(v+M[i][j]))
dp[i][j].add(abs(v-M[i][j]))
# for r in M:
# print(r)
# for r in dp:
# print(r)
return min(map(abs, dp[H-1][W-1]))
def main():
H, W = read_int_n()
A = [read_int_n() for _ in range(H)]
B = [read_int_n() for _ in range(H)]
print(slv(H, W, A, B))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
@mt
def slv(H, W, A, B):
M = [[abs(a-b) for a, b in zip(ar, br)] for ar, br in zip(A, B)]
S = W*H*80
dp = [[0 for _ in range(W)] for __ in range(H)]
dp[0][0] = 1 << (S-M[0][0]) | 1 << (S+M[0][0])
for i in range(H):
for j in range(W):
for k, l in [(-1, 0), (0, -1)]:
D = M[i][j]
dp[i][j] |= dp[i+k][j+l] << D
dp[i][j] |= dp[i+k][j+l] >> D
ans = None
cand = dp[H-1][W-1]
for i in range(H*W*80):
if cand & (1 << (S+i)) != 0:
ans = i
break
assert ans is not None
return ans
def main():
H, W = read_int_n()
A = [read_int_n() for _ in range(H)]
B = [read_int_n() for _ in range(H)]
print(slv(H, W, A, B))
# H = 80
# W = 80
# # A = [[random.randint(0, 1000) for __ in range(W)] for _ in range(H)]
# # B = [[random.randint(0, 1000) for __ in range(W)] for _ in range(H)]
# A = [[0 for __ in range(W)] for _ in range(H)]
# B = [[random.randint(0, 80) for __ in range(W)] for _ in range(H)]
# print(slv(H, W, A, B))
if __name__ == '__main__':
main()
| p02839 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def main():
inf = 10 ** 16
h, w = MI()
aa = LLI(h)
bb = LLI(h)
cc = [[a - b for a, b in zip(ar, br)] for ar, br in zip(aa, bb)]
dp = [[set() for _ in range(w)] for _ in range(h)]
dp0 = dp[0]
dp0[0].add(abs(cc[0][0]))
for j in range(1, w):
c = cc[0][j]
for a in dp0[j - 1]:
dp0[j].add(abs(a + c))
dp0[j].add(abs(a - c))
for i in range(1, h):
c = cc[i][0]
for a in dp[i - 1][0]:
dp[i][0].add(abs(a + c))
dp[i][0].add(abs(a - c))
for i in range(1, h):
dpi=dp[i]
dpi1=dp[i-1]
cci=cc[i]
for j in range(1, w):
c = cci[j]
for a in dpi1[j]:
dpi[j].add(abs(a + c))
dpi[j].add(abs(a - c))
for a in dpi[j - 1]:
dpi[j].add(abs(a + c))
dpi[j].add(abs(a - c))
print(min(dp[h-1][w-1]))
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def bin_out(aa):
bb = [format(a, "b") for a in aa]
print(bb)
def main():
h, w = MI()
aa = LLI(h)
bb = LLI(h)
max_val=6400
zero = 1 << max_val
dp = [0] * w
dp[0] = zero
#bin_out(dp)
for i, (ar, br) in enumerate(zip(aa, bb)):
for j, (a, b) in enumerate(zip(ar, br)):
d = abs(a - b)
if j > 0: dp[j] |= dp[j - 1]
dp[j] = dp[j] << d | dp[j] >> d
#bin_out(dp)
goal = dp[-1]
for ans in range(max_val + 1):
if goal & zero << ans or goal & zero >> ans:
print(ans)
break
main()
| p02839 |
import sys
input=sys.stdin.readline
h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d=[]
for i in range(h):
lis=[]
for j in range(w):
lis.append(abs(a[i][j]-b[i][j]))
d.append(lis)
dp = [[[0 for _ in range(80*(h+w))] for _ in range(w)] for _ in range(h)]
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
nxt=d[nowh][nxtw]
if k+nxt < 6400:
dp[nowh*w + nxtw][k+nxt] = 1
dp[nowh*w + nxtw][abs(k-nxt)] = 1
if nxth<h:
nxt=d[nxth][noww]
if k+nxt < 6400:
dp[nxth*w + noww][k+nxt] = 1
dp[nxth*w + noww][abs(k-nxt)] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | import sys
input=sys.stdin.readline
h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d=[]
for i in range(h):
lis=[]
for j in range(w):
lis.append(abs(a[i][j]-b[i][j]))
d.append(lis)
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
nxt=d[nowh][nxtw]
if k+nxt < 6400:
dp[nowh*w + nxtw][k+nxt] = 1
dp[nowh*w + nxtw][abs(k-nxt)] = 1
if nxth<h:
nxt=d[nxth][noww]
if k+nxt < 6400:
dp[nxth*w + noww][k+nxt] = 1
dp[nxth*w + noww][abs(k-nxt)] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | p02839 |
import sys
input=sys.stdin.readline
h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d = [[0 for j in range(w)] for i in range(h)]
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
nxt=d[nowh][nxtw]
if k+nxt < 6400:
dp[nowh*w + nxtw][k+nxt] = 1
dp[nowh*w + nxtw][abs(k-nxt)] = 1
if nxth<h:
nxt=d[nxth][noww]
if k+nxt < 6400:
dp[nxth*w + noww][k+nxt] = 1
dp[nxth*w + noww][abs(k-nxt)] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | import sys
input=sys.stdin.readline
h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d = [[0 for j in range(w)] for i in range(h)]
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
if k+d[nowh][nxtw] < 6400:
dp[nowh*w + nxtw][k+d[nowh][nxtw]] = 1
dp[nowh*w + nxtw][abs(k-d[nowh][nxtw])] = 1
if nxth<h:
if k+ d[nxth][noww]< 6400:
dp[nxth*w + noww][k+d[nxth][noww]] = 1
dp[nxth*w + noww][abs(k-d[nxth][noww])] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | p02839 |
import sys
input=sys.stdin.readline
h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d = [[0 for j in range(w)] for i in range(h)]
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
if k+d[nowh][nxtw] < 6400:
dp[nowh*w + nxtw][k+d[nowh][nxtw]] = 1
dp[nowh*w + nxtw][abs(k-d[nowh][nxtw])] = 1
if nxth<h:
if k+ d[nxth][noww]< 6400:
dp[nxth*w + noww][k+d[nxth][noww]] = 1
dp[nxth*w + noww][abs(k-d[nxth][noww])] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | h,w = list(map(int, input().split()))
a=[list(map(int,input().split())) for i in range(h)]
b=[list(map(int,input().split())) for i in range(h)]
d = [[0 for j in range(w)] for i in range(h)]
for i in range(h):
for j in range(w):
d[i][j] = abs(a[i][j]-b[i][j])
dp = [[0 for _ in range(6400)] for _ in range(h*w)]
dp[0][d[0][0]]=1
for i in range(h*w):
nowh,noww = divmod(i,w)
for k in range(6400):
if not dp[nowh*w + noww][k]==1:
continue
nxth,nxtw=nowh+1, noww+1
if nxtw<w:
if k+d[nowh][nxtw] < 6400:
dp[nowh*w + nxtw][k+d[nowh][nxtw]] = 1
dp[nowh*w + nxtw][abs(k-d[nowh][nxtw])] = 1
if nxth<h:
if k+ d[nxth][noww]< 6400:
dp[nxth*w + noww][k+d[nxth][noww]] = 1
dp[nxth*w + noww][abs(k-d[nxth][noww])] = 1
for k in range(6400):
if dp[-1][k]==1:
print(k)
exit() | p02839 |
H, W = list(map(int, input().split()))
A = []
B = []
for _ in range(H):
A.append(list(map(int, input().split())))
for _ in range(H):
B.append(list(map(int, input().split())))
d = [[0]*W for _ in range(H)]
for h in range(H):
for w in range(W):
d[h][w] = abs(A[h][w]-B[h][w])
dp = [[[] for _ in range(W)] for _ in range(H)]
dp[0][0].append(d[0][0])
for h in range(H):
for w in range(W):
if h < H-1:
dp[h+1][w] += list([x+d[h+1][w] for x in dp[h][w]])
dp[h+1][w] += list([abs(x-d[h+1][w]) for x in dp[h][w]])
if w < W-1:
dp[h][w+1] += list([x+d[h][w+1] for x in dp[h][w]])
dp[h][w+1] += list([abs(x-d[h][w+1]) for x in dp[h][w]])
print((min(dp[-1][-1]))) | def max2(x,y):
return x if x > y else y
H, W = list(map(int, input().split()))
A = []
B = []
ofs = 80*H*W
for _ in range(H):
A.append(list(map(int, input().split())))
for _ in range(H):
B.append(list(map(int, input().split())))
d = [[0]*W for _ in range(H)]
for h in range(H):
for w in range(W):
d[h][w] = abs(A[h][w]-B[h][w])
dp = [[0 for _ in range(W)] for _ in range(H)]
dp[0][0] = 1<<ofs
dp[0][0] = (dp[0][0]<<d[0][0])|(dp[0][0]>>d[0][0])
for h in range(H):
for w in range(W):
if h < H-1:
dp[h+1][w] |= (dp[h][w]<<d[h+1][w])|(dp[h][w]>>d[h+1][w])
if w < W-1:
dp[h][w+1] |= (dp[h][w]<<d[h][w+1])|(dp[h][w]>>d[h][w+1])
res = dp[-1][-1]>>ofs
print(((-res&res).bit_length()-1)) | p02839 |
import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
la = [list(map(int,input().split())) for i in range(h)]
lb = [list(map(int,input().split())) for i in range(h)]
k = (h+w)*80+2
dp = [[[-1 for l in range(k)] for i in range(w)] for j in range(h)]
dp[0][0][abs(la[0][0]-lb[0][0])] = 1
for i in range(h):
for j in range(w):
for l in range(k):
if dp[i][j][l] == 1:
if j + 1 < w:
a = abs(la[i][j+1]-lb[i][j+1])
dp[i][j+1][l+a] = 1
dp[i][j+1][abs(l-a)] = 1
if i + 1 < h:
a = abs(la[i+1][j]-lb[i+1][j])
dp[i+1][j][l+a] = 1
dp[i+1][j][abs(l-a)] = 1
print((dp[-1][-1].index(1))) | import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
la = [list(map(int,input().split())) for i in range(h)]
for i in range(h):
l = list(map(int,input().split()))
for j,num in enumerate(l):
la[i][j] = abs(la[i][j]-num)
dp = [[0 for i in range(w)] for j in range(h)]
k = (h+w)*80+2
dp[0][0] = 1 << (k+la[0][0]) | 1 << (k-la[0][0])
for i in range(h):
for j in range(w):
if i:
dp[i][j] |= (dp[i-1][j] << la[i][j]) | dp[i-1][j] >> la[i][j]
if j:
dp[i][j] |= (dp[i][j-1] << la[i][j]) | dp[i][j-1] >> la[i][j]
s = bin(dp[-1][-1])[2:]
l = len(s)-1
ans = float('inf')
for i in range(l,-1,-1):
if s[i]=='1':
m = abs(l-i-k)
if m<ans:
ans = m
print(ans)
| p02839 |
import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
la = [list(map(int,input().split())) for i in range(h)]
for i in range(h):
l = list(map(int,input().split()))
for j,num in enumerate(l):
la[i][j] = abs(la[i][j]-num)
dp = [[0 for i in range(w)] for j in range(h)]
k = (h+w)*80+2
dp[0][0] = 1 << (k+la[0][0]) | 1 << (k-la[0][0])
for i in range(h):
for j in range(w):
if i:
dp[i][j] |= (dp[i-1][j] << la[i][j]) | dp[i-1][j] >> la[i][j]
if j:
dp[i][j] |= (dp[i][j-1] << la[i][j]) | dp[i][j-1] >> la[i][j]
s = bin(dp[-1][-1])[2:]
l = len(s)-1
ans = float('inf')
for i in range(l,-1,-1):
if s[i]=='1':
m = abs(l-i-k)
if m<ans:
ans = m
print(ans)
| import sys
input = sys.stdin.readline
h,w = list(map(int,input().split()))
la = [list(map(int,input().split())) for i in range(h)]
for i in range(h):
l = list(map(int,input().split()))
for j,num in enumerate(l):
la[i][j] = abs(la[i][j]-num)
dp = [[0 for i in range(w)] for j in range(h)]
k = (h+w)*80+2
dp[0][0] = 1 << (k+la[0][0]) | 1 << (k-la[0][0])
for i in range(h):
for j in range(w):
if i:
dp[i][j] |= (dp[i-1][j] << la[i][j]) | dp[i-1][j] >> la[i][j]
if j:
dp[i][j] |= (dp[i][j-1] << la[i][j]) | dp[i][j-1] >> la[i][j]
check = dp[-1][-1]
for i in range(k):
if (check >> k+i) & 1 or (check >> k-i) & 1:
print(i)
exit()
| p02839 |
from collections import defaultdict
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(H)]
B = [list(map(int, input().split())) for i in range(H)]
dp = defaultdict(set)
dp[(0, 0)].add(abs(A[0][0] - B[0][0]))
for i in range(H):
for j in range(W):
d = abs(A[i][j] - B[i][j])
if i > 0:
for k in dp[(i - 1, j)]:
dp[(i, j)].add(abs(k + d))
dp[(i, j)].add(abs(k - d))
if j > 0:
for k in dp[(i, j - 1)]:
dp[(i, j)].add(abs(k + d))
dp[(i, j)].add(abs(k - d))
print((min(dp[(H - 1, W - 1)])))
| H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(H)]
B = [list(map(int, input().split())) for i in range(H)]
dp = [[0] * W for i in range(H)]
dp[0][0] = 1 << (abs(A[0][0] - B[0][0]) + 6400)
for i in range(H):
for j in range(W):
d = abs(A[i][j] - B[i][j])
if i > 0:
dp[i][j] |= dp[i - 1][j] << d | dp[i - 1][j] >> d
if j > 0:
dp[i][j] |= dp[i][j - 1] << d | dp[i][j - 1] >> d
ans = 0
res = dp[H - 1][W - 1] >> 6400
while res & 1 == 0:
res >>= 1
ans += 1
print(ans)
| p02839 |
H, W = [int(x) for x in input().split()]
A = [[0]*W for i in range(H)]
for c in [1, -1]:
for i in range(H):
arr = [int(x) for x in input().split()]
for j in range(W):
A[i][j] += arr[j] * c
M = 160*80
dp = [[0]*W for i in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[i-1][j]
if j > 0:
dp[i][j] |= dp[i][j-1]
a = abs(A[i][j])
dp[i][j] = (dp[i][j] << a) | (dp[i][j] >> a)
ans = M
for i in range(2*M):
if dp[H-1][W-1] & (1 << i) > 0:
ans = min(ans, abs(M-i))
print(ans)
| # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# template
def resolve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for _ in range(h)]
B = [list(map(int, readline().split())) for _ in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
from itertools import product
for i, j in product(list(range(h)), list(range(w))):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
| p02839 |
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 3200
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
| # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 1000
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [[0]*w for _ in range(h)]
x = abs(A[0][0]-B[0][0])
dp[0][0] |= ((1 << (ofs+x)) | (1 << (ofs-x)))
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = 0
if(i-1 >= 0):
t |= dp[i-1][j]
if(j-1 >= 0):
t |= dp[i][j-1]
dp[i][j] |= ((t << x) | (t >> x))
for i, s in enumerate(bin(dp[-1][-1])[-ofs-1:]):
if(s == '1'):
print(i)
return
if __name__ == "__main__":
INF = float("inf")
MOD = 10**9+7
resolve()
| p02839 |
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 6400
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [0 for _ in range(w+1)]
x = abs(A[0][0]-B[0][0])
dp[0] = 1 << ofs
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = (dp[j] | dp[j-1])
dp[j] = ((t << x) | (t >> x))
b = list([s == '1' for s in list(bin(dp[w-1])[-ofs-1:-ofs+100])])
for i, s in enumerate(b):
if(s):
print(i)
return
if __name__ == "__main__":
solve()
| # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def solve():
ofs = 1000
h, w = list(map(int, readline().split()))
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i in range(h)]
dp = [0 for _ in range(w+1)]
x = abs(A[0][0]-B[0][0])
dp[0] = 1 << ofs
for i in range(h):
for j in range(w):
x = abs(A[i][j]-B[i][j])
t = (dp[j] | dp[j-1])
dp[j] = ((t << x) | (t >> x))
b = list([s == '1' for s in list(bin(dp[w-1])[-ofs-1:-ofs+100])])
for i, s in enumerate(b):
if(s):
print(i)
return
if __name__ == "__main__":
solve()
| p02839 |
import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
A = []
B = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
B.append(line)
def slide_down(y, x, possible):
new = set()
delta = abs(A[y+1][x] - B[y+1][x])
limit = (h+w) * 80
for num in possible:
if num + delta <= limit - (y+x)*80:
new.add(num+delta)
if abs(num-delta) <= limit - (y+x)*80:
new.add(abs(num-delta))
return new
def slide_right(y, x, possible):
new = set()
delta = abs(A[y][x+1] - B[y][x+1])
limit = (h+w) * 80
for num in possible:
if num + delta <= limit - (y+x)*80:
new.add(num+delta)
if abs(num-delta) <= limit - (y+x)*80:
new.add(abs(num-delta))
return new
DP = [[set() for j in range(w)] for i in range(h)]
DP[0][0] = {abs(A[0][0] - B[0][0])}
for row in range(h):
for col in range(w):
possible = DP[row][col]
if col < w-1:
new = slide_right(row, col, possible)
DP[row][col+1] |= new
if row < h-1:
new = slide_down(row, col, possible)
DP[row+1][col] |= new
ans = min(DP[h-1][w-1])
print(ans) | import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
A = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
for j, num in enumerate(line):
A[i][j] = abs(A[i][j] - num)
const = 6400
bitset = 1 << const
DP = [[0]*w for _ in range(h)]
DP[0][0] = bitset >> A[0][0]
def slide_down(y, x):
bit = DP[y][x]
delta = A[y+1][x]
new1 = bit << delta
new2 = bit >> delta
DP[y+1][x] |= new1 | new2
def slide_right(y, x):
bit = DP[y][x]
delta = A[y][x+1]
new1 = bit << delta
new2 = bit >> delta
DP[y][x+1] |= new1 | new2
for y in range(h):
for x in range(w):
if y < h-1:
slide_down(y, x)
if x < w-1:
slide_right(y, x)
ans = DP[h-1][w-1]
for i in range(81):
if (ans >> const+i) & 1 or (ans >> const-i) & 1:
print(i)
exit()
| p02839 |
import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
A = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
for j, num in enumerate(line):
A[i][j] = abs(A[i][j] - num)
const = 6400
bitset = 1 << const
DP = [[0]*w for _ in range(h)]
DP[0][0] = bitset >> A[0][0]
def slide_down(y, x):
bit = DP[y][x]
delta = A[y+1][x]
new1 = bit << delta
new2 = bit >> delta
DP[y+1][x] |= new1 | new2
def slide_right(y, x):
bit = DP[y][x]
delta = A[y][x+1]
new1 = bit << delta
new2 = bit >> delta
DP[y][x+1] |= new1 | new2
for y in range(h):
for x in range(w):
if y < h-1:
slide_down(y, x)
if x < w-1:
slide_right(y, x)
ans = DP[h-1][w-1]
for i in range(81):
if (ans >> const+i) & 1 or (ans >> const-i) & 1:
print(i)
exit()
| import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
A = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
for j, num in enumerate(line):
A[i][j] = abs(A[i][j] - num)
const = 6400
bitset = 1 << const
DP = [0]*w
DP[0] = bitset >> A[0][0]
def slide_down(y, x):
bit = DP[x]
delta = A[y+1][x]
new1 = bit << delta
new2 = bit >> delta
DP[x] = new1 | new2
def slide_right(y, x):
bit = DP[x]
delta = A[y][x+1]
new1 = bit << delta
new2 = bit >> delta
DP[x+1] |= new1 | new2
for y in range(h):
for x in range(w):
if x < w-1:
slide_right(y, x)
if y < h-1:
slide_down(y, x)
ans = DP[w-1]
for i in range(81):
if (ans >> const+i) & 1 or (ans >> const-i) & 1:
print(i)
exit()
| p02839 |
import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
A = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
for j, num in enumerate(line):
A[i][j] = abs(A[i][j] - num)
const = 640000
bitset = 1 << const
DP = [0]*w
DP[0] = bitset >> A[0][0]
def slide_down(y, x):
bit = DP[x]
delta = A[y+1][x]
new1 = bit << delta
new2 = bit >> delta
DP[x] = new1 | new2
def slide_right(y, x):
bit = DP[x]
delta = A[y][x+1]
new1 = bit << delta
new2 = bit >> delta
DP[x+1] |= new1 | new2
for y in range(h):
for x in range(w):
if x < w-1:
slide_right(y, x)
if y < h-1:
slide_down(y, x)
ans = DP[w-1]
for i in range(81):
if (ans >> const+i) & 1 or (ans >> const-i) & 1:
print(i)
exit()
| h, w = list(map(int, input().split()))
A = []
for i in range(h):
line = list(map(int, input().split()))
A.append(line)
for i in range(h):
line = list(map(int, input().split()))
for j, num in enumerate(line):
A[i][j] = abs(A[i][j] - num)
const = 6400
mask = 1 << const
DP = [0]*w
DP[0] = mask >> A[0][0]
def slide_down(y, x):
bit = DP[x]
delta = A[y+1][x]
new1 = bit << delta
new2 = bit >> delta
DP[x] = new1 | new2
def slide_right(y, x):
bit = DP[x]
delta = A[y][x+1]
new1 = bit << delta
new2 = bit >> delta
DP[x+1] |= new1 | new2
for y in range(h):
for x in range(w):
if x < w-1:
slide_right(y, x)
if y < h-1:
slide_down(y, x)
pattern = DP[w-1]
for i in range(81):
if (pattern >> const+i) & 1 or (pattern >> const-i) & 1:
print(i)
exit()
| p02839 |
import itertools
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
H, W = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
B = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
grid = [[0] * W for _ in range(H)]
for h, w in itertools.product(list(range(H)), list(range(W))):
grid[h][w] = A[h][w] - B[h][w]
LIMIT = 80 * 40 * 40
# 符号をどっちにするか選べる
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {grid[0][0], -grid[0][0]}
for h, w in itertools.product(list(range(H)), list(range(W))):
g = grid[h][w]
if h - 1 >= 0:
for c in dp[h - 1][w]:
if -LIMIT <= c + g <= LIMIT:
dp[h][w].add(c + g)
if -LIMIT <= c - g <= LIMIT:
dp[h][w].add(c - g)
if w - 1 >= 0:
for c in dp[h][w - 1]:
if -LIMIT <= c + g <= LIMIT:
dp[h][w].add(c + g)
if -LIMIT <= c - g <= LIMIT:
dp[h][w].add(c - g)
ans = INF
for s in dp[-1][-1]:
ans = min(ans, abs(s))
print(ans)
| import itertools
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
H, W = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
B = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
grid = [[0] * W for _ in range(H)]
for h, w in itertools.product(list(range(H)), list(range(W))):
grid[h][w] = A[h][w] - B[h][w]
LIMIT = 80 * 80
# 符号をどっちにするか選べる
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {grid[0][0], -grid[0][0]}
for h, w in itertools.product(list(range(H)), list(range(W))):
g = grid[h][w]
s = dp[h][w]
if h - 1 >= 0:
for c in dp[h - 1][w]:
if abs(c + g) <= LIMIT:
s.add(abs(c + g))
if abs(c - g) <= LIMIT:
s.add(abs(c - g))
if w - 1 >= 0:
for c in dp[h][w - 1]:
if abs(c + g) <= LIMIT:
s.add(abs(c + g))
if abs(c - g) <= LIMIT:
s.add(abs(c - g))
ans = INF
for s in dp[-1][-1]:
ans = min(ans, abs(s))
print(ans)
| p02839 |
import itertools
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
H, W = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
B = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
grid = [[0] * W for _ in range(H)]
for h, w in itertools.product(list(range(H)), list(range(W))):
grid[h][w] = A[h][w] - B[h][w]
# 符号をどっちにするか選べる
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {grid[0][0], -grid[0][0]}
for h, w in itertools.product(list(range(H)), list(range(W))):
g = grid[h][w]
s = dp[h][w]
limit = (H - h + 1) * (W - w + 1) * 80
if h - 1 >= 0:
for c in dp[h - 1][w]:
if abs(c + g) <= limit:
s.add(abs(c + g))
if abs(c - g) <= limit:
s.add(abs(c - g))
if w - 1 >= 0:
for c in dp[h][w - 1]:
if abs(c + g) <= limit:
s.add(abs(c + g))
if abs(c - g) <= limit:
s.add(abs(c - g))
ans = INF
for s in dp[-1][-1]:
ans = min(ans, abs(s))
print(ans)
| import itertools
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
H, W = list(map(int, sys.stdin.buffer.readline().split()))
A = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
B = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(H)]
grid = [[0] * W for _ in range(H)]
for h, w in itertools.product(list(range(H)), list(range(W))):
grid[h][w] = A[h][w] - B[h][w]
# 符号をどっちにするか選べる
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {grid[0][0] % 800, -(grid[0][0]) % 800}
for h, w in itertools.product(list(range(H)), list(range(W))):
g = grid[h][w]
s = dp[h][w]
if h - 1 >= 0:
for c in dp[h - 1][w]:
s.add((c + g) % 800)
s.add((c - g) % 800)
if w - 1 >= 0:
for c in dp[h][w - 1]:
s.add((c + g) % 800)
s.add((c - g) % 800)
# print(grid)
# print(dp)
ans = INF
for s in dp[-1][-1]:
ans = min(ans, s)
ans = min(ans, (-s) % 800)
print(ans)
| p02839 |
H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in [0]*H]
B = [list(map(int,input().split())) for _ in [0]*H]
C = [[abs(b-a) for a,b in zip(a_row,b_row)] for a_row,b_row in zip(A,B)]
d = [[set() for _ in [0]*W] for _ in [0]*H]
d[0][0] = {C[0][0]}
for i in range(H):
for j in range(W):
for n in d[i][j]:
if i+1<H:
c = C[i+1][j]
d[i+1][j].add(n+c)
d[i+1][j].add(abs(n-c))
if j+1<W:
c = C[i][j+1]
d[i][j+1].add(n+c)
d[i][j+1].add(abs(n-c))
ans = min(abs(o) for o in d[-1][-1])
print(ans) | H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in [0]*H]
B = [list(map(int,input().split())) for _ in [0]*H]
C = [[abs(b-a) for a,b in zip(a_row,b_row)] for a_row,b_row in zip(A,B)]
dm = [[0]*W for _ in [0]*H]
dm[-1][-1] = 80
for i in range(H-1,-1,-1):
for j in range(W-1,-1,-1):
c = C[i][j]
if i-1>=0:
dm[i-1][j] = max(dm[i-1][j],dm[i][j] + c)
if j-1>=0:
dm[i][j-1] = max(dm[i][j-1],dm[i][j] + c)
d = [[set() for _ in [0]*W] for _ in [0]*H]
d[0][0] = {C[0][0]}
for i in range(H):
for j in range(W):
for n in d[i][j]:
if i+1<H:
c = C[i+1][j]
if n+c <= dm[i][j]:
d[i+1][j].add(n+c)
if n-c <= dm[i][j]:
d[i+1][j].add(abs(n-c))
if j+1<W:
c = C[i][j+1]
if n+c <= dm[i][j]:
d[i][j+1].add(n+c)
if n-c <= dm[i][j]:
d[i][j+1].add(abs(n-c))
ans = min(abs(o) for o in d[-1][-1])
print(ans) | p02839 |
import sys
from collections import defaultdict
input = sys.stdin.readline
H, W = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
dp = [[defaultdict(lambda : False) for _ in range(W)] for _ in range(H)]
dp[0][0][0] = True
for h in range(H):
for w in range(W):
C = A[h][w] - B[h][w]
for v, f in list(dp[h][w].items()):
if f:
if h < H - 1:
dp[h + 1][w][v + C] = True
dp[h + 1][w][v - C] = True
if w < W - 1:
dp[h][w + 1][v + C] = True
dp[h][w + 1][v - C] = True
ans = 10**10
C = A[H - 1][W - 1] - B[H - 1][W - 1]
for v, f in list(dp[H - 1][W - 1].items()):
if f:
ans = min(ans, abs(v - C))
ans = min(ans, abs(v + C))
print(ans) | H, W = list(map(int, input().split()))
M = (H + W) * 80
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
dp = [[0] * W for _ in range(H)]
dp[0][0] = (1 << (M - abs(A[0][0] - B[0][0])))
for h in range(H):
for w, (a, b) in enumerate(zip(A[h], B[h])):
d = abs(a - b)
mask = 0
if h > 0:
mask |= (dp[h - 1][w] << d)
mask |= (dp[h - 1][w] >> d)
if w > 0:
mask |= (dp[h][w - 1] << d)
mask |= (dp[h][w - 1] >> d)
dp[h][w] |= mask
state = dp[-1][-1]
nums = []
for digit, b in enumerate(bin(state)[2:][:: -1]):
if b == '1':
nums.append(digit - M)
ans = min(abs(n) for n in nums)
print(ans)
| p02839 |
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
h,w = ma()
A = []
for i in range(h):
A.append(lma())
B= []
for i in range(h):
B.append(lma())
D = [[abs(A[i][j]-B[i][j]) for j in range(w)] for i in range(h)]
mx = 0
for i in range(h):
for j in range(w):
mx = max(mx,D[i][j])
prev = [[False]*((h+w)*mx+1) for j in range(w)]
nex = [[False]*((h+w)*mx+1) for j in range(w)]
prev[0][0]=True
for i in range(h):
for j in range(w):
d = D[i][j]
if j==0:
for k in range((h+w)*mx+1-d):
nex[j][k+d] = nex[j][k+d] or prev[j][k]
nex[j][abs(k-d)] = nex[j][abs(k-d)] or prev[j][k]
else:
for k in range((h+w)*mx+1-d):
nex[j][k+d] = nex[j][k+d] or prev[j][k] or nex[j-1][k]
nex[j][abs(k-d)] = nex[j][abs(k-d)] or prev[j][k] or nex[j-1][k]
prev=nex
nex=[[False]*((h+w)*mx+1) for j in range(w)]
for i in range((h+w)*mx+1):
if prev[w-1][i]:
print(i)
exit()
| ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
h,w = ma()
A = []
for i in range(h):
A.append(lma())
B= []
for i in range(h):
B.append(lma())
D = [[abs(A[i][j]-B[i][j]) for j in range(w)] for i in range(h)]
mx = 0
for i in range(h):
for j in range(w):
mx = max(mx,D[i][j])
le = (h+w)*mx
prev = [0]*w
nex = [0]*w
prev[0]=prev[0] | 2**le
for i in range(h):
for j in range(w):
d = D[i][j]
if j==0:
nex[j] = nex[j] | prev[j]>>d |prev[j]<<d
else:
nex[j] = nex[j] | prev[j]>>d |prev[j]<<d
nex[j] = nex[j] | nex[j-1]>>d |nex[j-1]<<d
#print(i,j,d,bin(nex[j]))
prev=nex
nex = [0]*w
for i in range(le+1):
if (prev[w-1]>>le+i &1) or (prev[w-1]>>le-i &1):
print(i)
exit()
| p02839 |
import sys
import math
import bisect
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
M = 80
A = [[0] * W for _ in range(H)]
K = M * (H + W) + 1
for i in range(H):
a = list(map(int, input().split()))
A[i] = a
for i in range(H):
b = list(map(int, input().split()))
for j in range(W):
A[i][j] -= b[j]
dp = [[[False] * K for i in range(W)] for i in range(H)]
# dp[i][j][k]
dp[0][0][abs(A[0][0])] = True
for i in range(H):
for j in range(W):
if i != 0:
for k in range(K):
if dp[i - 1][j][k] is True:
dp[i][j][abs(k - A[i][j])] = True
dp[i][j][abs(k + A[i][j])] = True
if j != 0:
for k in range(K):
if dp[i][j - 1][k] == True:
dp[i][j][abs(k - A[i][j])] = True
dp[i][j][abs(k + A[i][j])] = True
for k in range(K):
if dp[H-1][W-1][k] ==True:
print(k)
exit()
if __name__ == "__main__":
main()
| import sys
import math
import bisect
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
H, W = list(map(int, input().split()))
A = [[0] * W for _ in range(H)]
for i in range(H):
a = list(map(int, input().split()))
A[i] = a
for i in range(H):
b = list(map(int, input().split()))
for j in range(W):
A[i][j] -= b[j]
dp = [[set() for i in range(W)] for i in range(H)]
# dp[i][j][k]
dp[0][0].add(A[0][0])
for i in range(H):
for j in range(W):
if i != 0:
for k in dp[i-1][j]:
dp[i][j].add(abs(k - A[i][j]))
dp[i][j].add(abs(k + A[i][j]))
if j != 0:
for k in dp[i][j-1]:
dp[i][j].add(abs(k - A[i][j]))
dp[i][j].add(abs(k + A[i][j]))
print((min(dp[H-1][W-1])))
if __name__ == "__main__":
main()
| p02839 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
h, w = LI()
a = LIR(h)
b = LIR(h)
mab = [[abs(a[y][x]-b[y][x]) for x in range(w)] for y in range(h)]
ab = abs(a[0][0] - b[0][0])
hw = h + w
dp = [[0] * w for i in range(h)]
dp[0][0] = 1 << ab
for i in range(1, h + w - 1):
mhw = (hw - i) * 80
for x in range(w):
y = i - x - 1
if 0 <= x < w and 0 <= y < h:
values = dp[y][x]
value = [z for z in range(values.bit_length()) if values & (1 << z) and z <= mhw]
else:
continue
for mx, my in [[0, 1], [1, 0]]:
mx += x
my += y
if 0 <= mx < w and 0 <= my < h:
mxy = mab[my][mx]
for v in value:
dp[my][mx] |= (1 << abs(v - mxy)) | (1 << (mxy + v))
ans = dp[-1][-1]
for i in range(ans.bit_length()):
if ans & (1 << i):
print(i)
return
return
#main
if __name__ == '__main__':
solve()
| #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list([int(x)-1 for x in input().split()])
def II(): return int(eval(input()))
def IF(): return float(eval(input()))
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')
#solve
def solve():
h, w = LI()
a = LIR(h)
b = LIR(h)
mab = [[abs(a[y][x]-b[y][x]) for x in range(w)] for y in range(h)]
ab = abs(a[0][0] - b[0][0])
hw = h + w
dp = [[0] * w for i in range(h)]
dp[0][0] |= (1 << (6400 + ab) | 1 << (6400 - ab))
for i in range(1, h + w - 1):
for x in range(w):
y = i - x - 1
if 0 <= x < w and 0 <= y < h:
value = dp[y][x]
else:
continue
for mx, my in [[0, 1], [1, 0]]:
mx += x
my += y
if 0 <= mx < w and 0 <= my < h:
mxy = mab[my][mx]
dp[my][mx] |= ((value << mxy) | (value >> mxy))
ans = dp[-1][-1]
for i in range(ans.bit_length()):
if ans & (1 << (6400-i)):
print(i)
return
return
#main
if __name__ == '__main__':
solve()
| p02839 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
from itertools import product
def resolve():
h,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().split())) for _ in range(h)]
dp=[[defaultdict(int) for _ in range(w)] for _ in range(h)]
x=A[-1][-1]-B[-1][-1]
dp[-1][-1][x]=1
dp[-1][-1][-x]=1
for i,j in product(list(range(h-1,-1,-1)),list(range(w-1,-1,-1))):
x=A[i][j]-B[i][j]
if(i+1<h):
for key,val in list(dp[i+1][j].items()):
if(val==1):
dp[i][j][key+x]=1
dp[i][j][key-x]=1
if(j+1<w):
for key,val in list(dp[i][j+1].items()):
if(val==1):
dp[i][j][key+x]=1
dp[i][j][key-x]=1
ans=INF
for key,val in list(dp[0][0].items()):
if(val==1): ans=min(ans,abs(key))
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
h,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().split())) for _ in range(h)]
dp=[[0]*w for _ in range(h)]
x=abs(A[0][0]-B[0][0])
dp[0][0]|=1<<x
from itertools import product
for i,j in product(list(range(h)),list(range(w))):
x=abs(A[i][j]-B[i][j])
if(i-1>=0):
for k,s in enumerate(bin(dp[i-1][j])[2:][::-1]):
if(s=='1'):
dp[i][j]|=1<<(k+x)
dp[i][j]|=1<<(abs(k-x))
if(j-1>=0):
for k,s in enumerate(bin(dp[i][j-1])[2:][::-1]):
if(s=='1'):
dp[i][j]|=1<<(k+x)
dp[i][j]|=1<<(abs(k-x))
for k,s in enumerate(bin(dp[-1][-1])[2::][::-1]):
if(s=='1'):
print(k)
return
resolve() | p02839 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
h,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().split())) for _ in range(h)]
dp=[[0]*w for _ in range(h)]
x=abs(A[0][0]-B[0][0])
dp[0][0]|=1<<x
from itertools import product
for i,j in product(list(range(h)),list(range(w))):
x=abs(A[i][j]-B[i][j])
if(i-1>=0):
for y,s in enumerate(bin(dp[i-1][j])[:1:-1]):
if(s=='1'):
dp[i][j]|=1<<(y+x)
dp[i][j]|=1<<(abs(y-x))
if(j-1>=0):
for y,s in enumerate(bin(dp[i][j-1])[:1:-1]):
if(s=='1'):
dp[i][j]|=1<<(y+x)
dp[i][j]|=1<<(abs(y-x))
for i,s in enumerate(bin(dp[-1][-1])[:1:-1]):
if(s=='1'):
print(i)
return
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
h,w=list(map(int,input().split()))
A=[list(map(int,input().split())) for _ in range(h)]
B=[list(map(int,input().split())) for _ in range(h)]
dp=[[0]*w for _ in range(h)]
x=abs(A[0][0]-B[0][0])
offset=12800
dp[0][0]|=1<<(x+offset)
dp[0][0]|=1<<(-x+offset)
from itertools import product
for i,j in product(list(range(h)),list(range(w))):
if(i==0 and j==0): continue
x=abs(A[i][j]-B[i][j])
S=0
if(i>0): S|=dp[i-1][j]
if(j>0): S|=dp[i][j-1]
dp[i][j]=(S<<x)|(S>>x)
for i in range(12800):
if((dp[-1][-1]>>(i+offset))&1):
print(i)
return
resolve() | p02839 |
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 6401
D = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
D[i][j] = abs(B[i][j] - A[i][j])
DP = [[[0] * M for _ in range(W)] for _ in range(H)]
def nasu(t):
if t >= 0 and t < M:
return True
else:
return False
DP[0][0][D[0][0]] = 1
for i in range(H + W):
for j in range(H):
if i - j >= W: continue
x = i - j
y = j
if x < 0: continue
if x - 1 >= 0:
for k in range(M):
if DP[y][x - 1][k] == 1:
t = k + D[y][x]
if nasu(t):
DP[y][x][t] = 1
t = abs(k - D[y][x])
if nasu(t):
DP[y][x][t] = 1
if y - 1 >= 0:
for k in range(M):
if DP[y - 1][x][k] == 1:
t = k + D[y][x]
if nasu(t):
DP[y][x][t] = 1
t = abs(k - D[y][x])
if nasu(t):
DP[y][x][t] = 1
for i in range(M):
if DP[-1][-1][i] == 1:
print(i)
break | H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
M = 6401
def honya(y, d):
t = (1 << d + 1) - 1
t = y & t
k = 0
for i in range(d):
k += t & 1
t >>= 1
k <<= 1
return k
D = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
D[i][j] = abs(B[i][j] - A[i][j])
DP = [[0] * W for _ in range(H)]
def nasu(x, y, d):
t = (1 << (d + 1)) - 1 & y
return (x | (y << d) | (y >> d) | honya(y, d)) & mask
mask = (1 << M) - 1
DP[0][0] = 1 << D[0][0]
for i in range(H):
for j in range(W):
if i + 1 < H:
DP[i + 1][j] = nasu(DP[i + 1][j], DP[i][j], D[i + 1][j])
if j + 1 < W:
DP[i][j + 1] = nasu(DP[i][j + 1], DP[i][j], D[i][j + 1])
t = DP[-1][-1]
for i in range(M):
if t & 1:
print(i)
break
t >>= 1
| p02839 |
H, W = list(map(int, input().split()))
A = []
for i in range(H):
A.append(list(map(int, input().split())))
B = []
for i in range(H):
B.append(list(map(int, input().split())))
dp = [[[0] * (H*W*80) for _ in range(W)] for _ in range(H)]
dp[0][0][abs(A[0][0]-B[0][0])] = 1
for i in range(H):
for j in range(W):
dif = abs(A[i][j] - B[i][j])
if i > 0:
for k in range(H*W*80):
if dp[i-1][j][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
if j > 0:
for k in range(H*W*80):
if dp[i][j-1][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
for k in range(H*W*80):
if dp[H-1][W-1][k] == 1:
ans = k
break
print(ans)
| H, W = list(map(int, input().split()))
A = []
for i in range(H):
A.append(list(map(int, input().split())))
B = []
for i in range(H):
B.append(list(map(int, input().split())))
dp = [[[0] * ((H+W)*80) for _ in range(W)] for _ in range(H)]
dp[0][0][abs(A[0][0]-B[0][0])] = 1
for i in range(H):
for j in range(W):
dif = abs(A[i][j] - B[i][j])
if i > 0:
for k in range((H+W)*80):
if dp[i-1][j][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
if j > 0:
for k in range((H+W)*80):
if dp[i][j-1][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
for k in range(H*W*80):
if dp[H-1][W-1][k] == 1:
ans = k
break
print(ans)
| p02839 |
H, W = list(map(int, input().split()))
A = []
for i in range(H):
A.append(list(map(int, input().split())))
B = []
for i in range(H):
B.append(list(map(int, input().split())))
dp = [[[0] * ((H+W)*80) for _ in range(W)] for _ in range(H)]
dp[0][0][abs(A[0][0]-B[0][0])] = 1
for i in range(H):
for j in range(W):
dif = abs(A[i][j] - B[i][j])
if i > 0:
for k in range((H+W)*80):
if dp[i-1][j][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
if j > 0:
for k in range((H+W)*80):
if dp[i][j-1][k] == 1:
dp[i][j][k+dif] = 1
if k >= dif:
dp[i][j][k-dif] = 1
else:
dp[i][j][dif-k] = 1
for k in range(H*W*80):
if dp[H-1][W-1][k] == 1:
ans = k
break
print(ans)
| H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(H)]
B = [list(map(int, input().split())) for i in range(H)]
center = 80 * (H+W)
C = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]
dp = [[0] * W for i in range(H)]
dp[0][0] = (1 << (center + C[0][0])) | (1 >> (center - C[0][0]))
for i in range(H):
for j in range(W):
if i:
dp[i][j] |= dp[i-1][j] << C[i][j]
dp[i][j] |= dp[i-1][j] >> C[i][j]
if j:
dp[i][j] |= dp[i][j-1] << C[i][j]
dp[i][j] |= dp[i][j-1] >> C[i][j]
ans = center * 2
for i in range(center*2):
if (dp[H-1][W-1] >> i) & 1:
ans = min(ans, abs(i-center))
print(ans)
| p02839 |
import sys
# input = sys.stdin.buffer.readline
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
MAX = 30000 # (80+80)*80=12800
MID = 15000 # 15000を0とする
H, W = list(map(int, input().split()))
A = [[int(x) for x in input().split()] for _ in range(H)]
B = [[int(x) for x in input().split()] for _ in range(H)]
C = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j] - B[i][j])
dp = [[[0]*MAX for _ in range(W)] for _ in range(H)]
dp[0][0][MID+C[0][0]] = 1
dp[0][0][MID-C[0][0]] = 1
for i in range(H):
for j in range(W):
if i:
for k in range(MAX):
if dp[i-1][j][k] == 1:
dp[i][j][k+C[i][j]] = 1
dp[i][j][k-C[i][j]] = 1
if j:
for k in range(MAX):
if dp[i][j-1][k] == 1:
dp[i][j][k+C[i][j]] = 1
dp[i][j][k-C[i][j]] = 1
ans = MAX
for i in range(MAX):
if dp[H-1][W-1][i] == 1:
ans = min(ans, abs(i-MID))
print(ans) | import sys
# input = sys.stdin.buffer.readline
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
H, W = list(map(int, input().split()))
A = [[int(x) for x in input().split()] for _ in range(H)]
B = [[int(x) for x in input().split()] for _ in range(H)]
C = [[0] * W for _ in range(H)]
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j] - B[i][j])
center = 80 * (H+W) # (80+80)*80=12800
dp = [[0] *W for _ in range(H)]
dp[0][0] = (1 << (center - C[0][0])) | (1 << (center + C[0][0]))
for i in range(H):
for j in range(W):
if i:
dp[i][j] |= dp[i-1][j] << C[i][j]
dp[i][j] |= dp[i-1][j] >> C[i][j]
if j:
dp[i][j] |= dp[i][j-1] << C[i][j]
dp[i][j] |= dp[i][j-1] >> C[i][j]
ans = center * 2
for i in range(center*2):
if (dp[H-1][W-1] >> i) & 1:
ans = min(ans, abs(i-center))
print(ans) | p02839 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
#mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np
def main():
h,w=list(map(int,input().split()))
G=[[0]*w for i in range(h)]
for i in range(h):
A=list(map(int,input().split()))
for j in range(w):
G[i][j]+=A[j]
for i in range(h):
B = list(map(int, input().split()))
for j in range(w):
G[i][j] =abs(G[i][j]-B[j])
M=(h+w)*80
li = [[[] for i in range(w)] for j in range(h)]
for i in range(h):
for j in range(w):
if i == j == 0:
li[i][j].append(G[i][j])
elif i == 0:
for k in li[i][j - 1]:
aa = abs(k - G[i][j])
bb = abs(k + G[i][j])
if aa <= M:
li[i][j].append(aa)
if abs(bb) <= M:
li[i][j].append(bb)
elif j == 0:
for k in li[i - 1][j]:
aa = abs(k - G[i][j])
bb = abs(k + G[i][j])
if aa <= M:
li[i][j].append(aa)
if abs(bb) <= M:
li[i][j].append(bb)
else:
for k in li[i - 1][j]:
aa = abs(k - G[i][j])
bb = abs(k + G[i][j])
if aa <= M:
li[i][j].append(aa)
if abs(bb) <= M:
li[i][j].append(bb)
for k in li[i][j - 1]:
aa = abs(k - G[i][j])
bb = abs(k + G[i][j])
if aa <= M:
li[i][j].append(aa)
if abs(bb) <= M:
li[i][j].append(bb)
s = set(li[i][j])
li[i][j] = list(s)
print((min(li[h - 1][w - 1])))
if __name__ == "__main__":
main() | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
h, w = list(map(int, input().split()))
G = [[0] * w for i in range(h)]
A = [0]*h
B = [0]*h
for i in range(h):
A[i] = list(map(int, input().split()))
for i in range(h):
B[i] = list(map(int, input().split()))
for i in range(h):
for j in range(w):
G[i][j]=abs(A[i][j]-B[i][j])
M = (h + w) * 80
li = [[[0] * M for i in range(w)] for j in range(h)]
li[0][0][G[0][0]] = 1
for i in range(h):
for j in range(w):
for k in range(M):
if li[i][j][k] == 1:
if i < h - 1:
li[i + 1][j][abs(k - G[i+1][j])] = 1
li[i + 1][j][abs(k + G[i+1][j])] = 1
if j < w - 1:
li[i][j + 1][abs(k - G[i][j+1])] = 1
li[i][j + 1][abs(k + G[i][j+1])] = 1
for i in range(M):
if li[h-1][w - 1][i] == 1:
print(i)
exit(0)
if __name__ == "__main__":
main()
| p02839 |
import sys
input=sys.stdin.readline
H,W=list(map(int,input().split()))
A=[0 for i in range(0,H)]
B=[0 for i in range(0,H)]
for i in range(0,H):
A[i]=list(map(int,input().split()))
for i in range(0,H):
B[i]=list(map(int,input().split()))
C=[[0 for i in range(0,W)] for j in range(0,H)]
for i in range(0,H):
for j in range(0,W):
C[i][j]=abs(A[i][j]-B[i][j])
dp=[[[False for k in range(0,min(80*(i+j+1)+1,80*(H-1-i+W-1-j+1)+1))] for i in range(0,W)] for j in range(0,H)]
dp[0][0][C[0][0]]=True
for i in range(0,H):
for j in range(0,W):
for k in range(0,min(80*(i+j+1)+1,80*(H-1-i+W-1-j+1)+1)):
ans=False
if i>=1:
if k+C[i][j]<len(dp[i-1][j]):
ans= ans or dp[i-1][j][k+C[i][j]]
if abs(k-C[i][j])<len(dp[i-1][j]):
ans= ans or dp[i-1][j][abs(k-C[i][j])]
if j>=1:
if k+C[i][j]<len(dp[i][j-1]):
ans= ans or dp[i][j-1][k+C[i][j]]
if abs(k-C[i][j])<len(dp[i][j-1]):
ans= ans or dp[i][j-1][abs(k-C[i][j])]
if (i,j)!=(0,0):
dp[i][j][k]=ans
ans=100
for i in range(0,80+1):
test=100
if dp[H-1][W-1][i]:
test=i
if ans>test:
ans=test
print(ans) | import sys
input=sys.stdin.readline
H,W=list(map(int,input().split()))
A=[0 for i in range(0,H)]
B=[0 for i in range(0,H)]
for i in range(0,H):
A[i]=list(map(int,input().split()))
for i in range(0,H):
B[i]=list(map(int,input().split()))
C=[[0 for i in range(0,W)] for j in range(0,H)]
for i in range(0,H):
for j in range(0,W):
C[i][j]=abs(A[i][j]-B[i][j])
dp=[[0 for i in range(0,W)] for i in range(0,H)]
if C[0][0]!=0:
dp[0][0]=pow(2,6400+C[0][0])+pow(2,6400-C[0][0])
else:
dp[0][0]=pow(2,6400)
for i in range(0,H):
for j in range(0,W):
ans1=0
ans2=0
if i!=0:
ans1=(dp[i-1][j]<<C[i][j])|(dp[i-1][j]>>C[i][j])
if j!=0:
ans2=(dp[i][j-1]<<C[i][j])|(dp[i][j-1]>>C[i][j])
if (i,j)!=(0,0):
dp[i][j]=ans1|ans2
ans=100
for i in range(0,80+1):
test=100
if dp[H-1][W-1]>>(6400+i) &1 ==1:
test=i
if ans>test:
ans=test
print(ans) | p02839 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {A[0][0] - B[0][0], B[0][0] - A[0][0]}
for h in range(H):
for w in range(W):
a, b = A[h][w], B[h][w]
if w - 1 >= 0:
for num in dp[h][w - 1]:
dp[h][w].add(num + a - b)
dp[h][w].add(num + b - a)
if h - 1 >= 0:
for num in dp[h - 1][w]:
dp[h][w].add(num + a - b)
dp[h][w].add(num + b - a)
res = f_inf
for num in dp[-1][-1]:
res = min(res, abs(num))
print(res)
if __name__ == '__main__':
resolve()
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
H, W = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
dp = [[set() for _ in range(W)] for _ in range(H)]
dp[0][0] = {abs(A[0][0] - B[0][0])}
for h in range(H):
for w in range(W):
a, b = A[h][w], B[h][w]
if w - 1 >= 0:
for num in dp[h][w - 1]:
dp[h][w].add(abs(num + a - b))
dp[h][w].add(abs(-num + a - b))
if h - 1 >= 0:
for num in dp[h - 1][w]:
dp[h][w].add(abs(num + a - b))
dp[h][w].add(abs(-num + a - b))
res = f_inf
for num in dp[-1][-1]:
res = min(res, abs(num))
print(res)
if __name__ == '__main__':
resolve()
| p02839 |
h,w = list(map(int,input().split()))
a = [list(map(int,input().split())) for _ in range(h)]
b = [list(map(int,input().split())) for _ in range(h)]
for i in range(h):
for j in range(w):
a[i][j] = abs(a[i][j] - b[i][j])
dp = [[0] * 9600 for _ in range(w*h)]
for i in range(h):
for j in range(w):
min_ = max(0, 3200 - min(i+j, 160-i-j)*80)
max_ = min(9599, 3200 + min(i+j, 160-i-j)*80)
a_tmp = a[i][j]
if(i==0)&(j==0):
dp[i*w+j][3200+a_tmp] += 1
dp[i*w+j][3200-a_tmp] += 1
elif(i==0):
for k in range(min_, max_+1):
if(k+a_tmp < 9600):
dp[i*w+j][k+a_tmp] += dp[i*w+j-1][k]
if(k-a_tmp >= 0):
dp[i*w+j][k-a_tmp] += dp[i*w+j-1][k]
elif(j==0):
for k in range(min_, max_+1):
if(k+a_tmp < 9600):
dp[i*w+j][k+a_tmp] += dp[i*w+j-w][k]
if(k+a_tmp >= 0):
dp[i*w+j][k-a_tmp] += dp[i*w+j-w][k]
else:
for k in range(min_, max_+1):
if(k+a_tmp < 9600):
dp[i*w+j][k+a_tmp] += dp[i*w+j-1][k]
dp[i*w+j][k+a_tmp] += dp[i*w+j-w][k]
if(k+a_tmp >= 0):
dp[i*w+j][k-a_tmp] += dp[i*w+j-1][k]
dp[i*w+j][k-a_tmp] += dp[i*w+j-w][k]
ans = 3200
for i in range(3100, 3300):
if(dp[-1][i] > 0):
ans = min(ans, abs(i-3200))
print(ans) | h,w = list(map(int,input().split()))
a = [list(map(int,input().split())) for _ in range(h)]
b = [list(map(int,input().split())) for _ in range(h)]
for i in range(h):
for j in range(w):
a[i][j] = abs(a[i][j] - b[i][j])
base = 2**12800 - 1
dp = [[0] * (w+1) for _ in range(h+1)]
dp[1][1] = (2**6400 >> a[0][0])|(2**6400 << a[0][0])&base
for i in range(1,h+1):
for j in range(1,w+1):
if(i==1)&(j==1):
dp[1][1] = (2**6400 >> a[0][0])|(2**6400 << a[0][0])&base
continue
dp[i][j] = ((dp[i-1][j] >> a[i-1][j-1])|(dp[i-1][j] << a[i-1][j-1])|
(dp[i][j-1] >> a[i-1][j-1])|(dp[i][j-1] << a[i-1][j-1]))&base
ans = 6400
ans_bit = dp[-1][-1]
for i in range(6300,6500):
if((ans_bit >> i)&1 == 1):
ans = min(ans, abs(6400-i))
print(ans) | p02839 |
h,w = list(map(int, input().split()))
al = []
bl = []
for _ in range(h):
row = list(map(int, input().split()))
al.append(row)
for _ in range(h):
row = list(map(int, input().split()))
bl.append(row)
cl = [ [0]*w for _ in range(h) ]
for i in range(h):
for j in range(w):
cl[i][j] = abs(al[i][j] - bl[i][j])
INF = 10**9
lim = (h+w)*80
# dp = [ [INF]*6400 for _ in range(h) ]
dp = [ [ [False]*(lim+1) for _ in range(w) ] for _ in range(h) ]
dp[0][0][cl[0][0]] = True
for i in range(h):
for j in range(w):
for k in range(0,lim+1):
if dp[i][j][k] == True:
if i+1 < h:
v = cl[i+1][j]
dp[i+1][j][k+v] = True
dp[i+1][j][abs(k-v)] = True
if j+1 < w:
v = cl[i][j+1]
dp[i][j+1][k+v] = True
dp[i][j+1][abs(k-v)] = True
for i,v in enumerate(dp[-1][-1]):
if v == True:
print(i)
break | h,w = list(map(int, input().split()))
al = []
bl = []
for _ in range(h):
row = list(map(int, input().split()))
al.append(row)
for _ in range(h):
row = list(map(int, input().split()))
bl.append(row)
cl = [ [0]*w for _ in range(h) ]
for i in range(h):
for j in range(w):
cl[i][j] = abs(al[i][j] - bl[i][j])
INF = 10**9
lim = (h+w)*80//2+1
# dp = [ [INF]*6400 for _ in range(h) ]
dp = [ [ [False]*(lim+1) for _ in range(w) ] for _ in range(h) ]
dp[0][0][cl[0][0]] = True
for i in range(h):
for j in range(w):
for k in range(0,lim+1):
if dp[i][j][k] == True:
if i+1 < h:
v = cl[i+1][j]
if k+v <= lim: dp[i+1][j][k+v] = True
dp[i+1][j][abs(k-v)] = True
if j+1 < w:
v = cl[i][j+1]
if k+v <= lim: dp[i][j+1][k+v] = True
dp[i][j+1][abs(k-v)] = True
for i,v in enumerate(dp[-1][-1]):
if v == True:
print(i)
break | p02839 |
from itertools import product
H, W = list(map(int, input().split()))
grid_A = [list(map(int, input().split())) for _ in range(H)]
grid_B = [list(map(int, input().split())) for _ in range(H)]
diff = []
M = 0
for A, B in zip(grid_A, grid_B):
temp = [abs(a - b) for a, b in zip(A, B)]
M = max(max(temp), M)
diff.append(temp)
dp = [[[False]*((H+W)*(M+1)) for _ in range(W)] for _ in range(H)]
dp[0][0][diff[0][0]] = True
for i, j in product(list(range(H)), list(range(W))):
for m in range((H+W)*(M+1)):
if dp[i][j][m]:
if i + 1 < H:
d = diff[i+1][j]
dp[i+1][j][m + d] = True
dp[i+1][j][abs(m - d)] = True
if j + 1 < W:
d = diff[i][j+1]
dp[i][j+1][m + d] = True
dp[i][j+1][abs(m - d)] = True
for i in range((H+W)*(M+1)):
if dp[H-1][W-1][i]:
print(i)
break | from itertools import product
def offset(a, b):
result = 0
if b == 0: return 0
for i in range(b+1):
if (a >> i) & 1:
result |= (1 << b) >> i
return result
H, W = list(map(int, input().split()))
diff = [list(map(int, input().split())) for _ in range(H)]
M = 80
for i in range(H):
B = list(map(int, input().split()))
for j in range(W):
diff[i][j] = abs(diff[i][j] - B[j])
dp = [[0]*W for _ in range(H)]
dp[0][0] = 1 << diff[0][0]
for i, j in product(list(range(H)), list(range(W))):
if (i, j) == (H-1, W-1): break
if i+1 < H:
k = diff[i+1][j]
dp[i+1][j] |= (dp[i][j] >> k) | (dp[i][j] << k) | (offset(dp[i][j], k))
if j+1 < W:
k = diff[i][j+1]
dp[i][j+1] |= (dp[i][j] >> k) | (dp[i][j] << k) | (offset(dp[i][j], k))
ans = dp[H-1][W-1]
print(((ans & -ans).bit_length() - 1)) | p02839 |
import sys
input = sys.stdin.readline
H,W = list(map(int,input().split()))
#差分だけで良い，これを*1 or -1していく
diff = [list(map(int, input().split())) for _ in range(H)]
for i in range(H):
B = list(map(int,input().split()))
for j in range(W):
diff[i][j] = abs(diff[i][j] - B[j])
# i,jマスにおいて，偏りがkになれるかどうかでDP
K = 4001 #適当
kk = int((K-1)/2)
dp = [[[False]*K for _ in range(W)] for _ in range(H)]
dp[0][0][kk+diff[0][0]] = True
dp[0][0][kk-diff[0][0]] = True
for i in range(H):
for j in range(W):
a= min((i+j)*80,kk)
for k in range(kk-a,kk+a+1):
if i-1>=0:
if k+diff[i][j]<K:
if dp[i-1][j][k+diff[i][j]]:
dp[i][j][k] =True
if k-diff[i][j]>=0:
if dp[i-1][j][k-diff[i][j]]:
dp[i][j][k] =True
if j-1>=0:
if k+diff[i][j]<K:
if dp[i][j-1][k+diff[i][j]]:
dp[i][j][k] =True
if k-diff[i][j]>=0:
if dp[i][j-1][k-diff[i][j]]:
dp[i][j][k] =True
ans = K
for k in range(K):
if dp[-1][-1][k]:
ans = min(ans,abs(k-kk))
print(ans) | import sys
input = sys.stdin.readline
H,W = list(map(int,input().split()))
#差分だけで良い，これを*1 or -1していく
diff = [list(map(int, input().split())) for _ in range(H)]
for i in range(H):
B = list(map(int,input().split()))
for j in range(W):
diff[i][j] = abs(diff[i][j] - B[j])
# i,jマスにおいて，偏りがkになれるかどうかでDP
#dp[i][j]にはkという数字にたどり着けるかどうかを示す2進数を入れる
dp = [[False]*W for _ in range(H)]
ofs = 80*(H+W)
dp[0][0]=(1<<(ofs+diff[0][0]) | 1>>(ofs-diff[0][0]))
for i in range(H):
for j in range(W):
if i>0:
dp[i][j]|=(dp[i-1][j]<<diff[i][j] | dp[i-1][j]>>diff[i][j])
if j>0:
dp[i][j]|=(dp[i][j-1]<<diff[i][j] | dp[i][j-1]>>diff[i][j])
#0のところから見て，最初に1が出てきたところが答え
for k in range(ofs):
if (dp[-1][-1]>>(k+ofs)&1):
print(k)
break | p02839 |
H,W = list(map(int, input().split()))
A = [[int(a) for a in input().split()] for _ in range(H)]
B = [[int(b) for b in input().split()] for _ in range(H)]
dp = [[{} for _ in range(W)] for _ in range(H)]
t = A[0][0]-B[0][0]
if t < 0:
dp[0][0][-t*2] = True
dp[0][0][-t*2-1] = True
elif t > 0:
dp[0][0][2*t-1] = True
dp[0][0][2*t] = True
else:
dp[0][0][0] = True
for i in range(H):
for j in range(W):
if i > 0:
for k in dp[i-1][j]:
if k % 2 == 0:
num = -k//2
else:
num = (k+1)//2
num += A[i][j]-B[i][j]
if num <= 0:
idx = -num*2
else:
idx = num*2-1
dp[i][j][idx] = True
num += (-A[i][j]+B[i][j])*2
if num <= 0:
idx = -num*2
else:
idx = num*2-1
dp[i][j][idx] = True
if j > 0:
for k in dp[i][j-1]:
if k % 2 == 0:
num = -k//2
else:
num = (k+1)//2
num += A[i][j]-B[i][j]
if num <= 0:
idx = -num*2
else:
idx = num*2-1
dp[i][j][idx] = True
num += (-A[i][j]+B[i][j])*2
if num <= 0:
idx = -num*2
else:
idx = num*2-1
dp[i][j][idx] = True
ans = 10**9
for k in dp[H-1][W-1]:
ans = min(ans, k//2+k%2)
print(ans) | H,W = list(map(int, input().split()))
A = [[int(a) for a in input().split()] for _ in range(H)]
B = [[int(b) for b in input().split()] for _ in range(H)]
C = [[0]*W for _ in range(H)]
num = 80
for i in range(H):
for j in range(W):
C[i][j] = abs(A[i][j]-B[i][j])
dp = [[0]*W for _ in range(H)]
dp[0][0] |= (1<<num+C[0][0]) | (1<<num-C[0][0])
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= (dp[i-1][j]<<num+C[i][j]) | (dp[i-1][j]<<num-C[i][j])
if j > 0:
dp[i][j] |= (dp[i][j-1]<<num+C[i][j]) | (dp[i][j-1]<<num-C[i][j])
b = list(bin(dp[-1][-1]))[::-1]
ans = 10**9
for i in range(len(b)):
if b[i] == "1":
ans = min(ans, abs(num*(H+W-1)-i))
print(ans) | p02839 |
H,W=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(H)]
B=[list(map(int,input().split())) for i in range(H)]
d=[[[0]*80*H*W for i in range(W+1)] for j in range(H+1)]
d[1][1][A[0][0]-B[0][0]]=d[1][1][B[0][0]-A[0][0]]=1
for h in range(H):
for w in range(W):
x=A[h][w]-B[h][w]
for y in range(80*H*W):
if d[h][w+1][y] or d[h+1][w][y]:
d[h+1][w+1][(y+x)%(80*H*W)]=d[h+1][w+1][(y-x)%(80*H*W)]=1
for i in range(40*H*W):
if d[H][W][i] or d[H][W][-i]:
print(i)
exit() | H,W=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(H)]
B=[list(map(int,input().split())) for i in range(H)]
d=[[set() for i in range(W+1)] for j in range(H+1)]
d[1][1].add(A[0][0]-B[0][0])
d[1][1].add(B[0][0]-A[0][0])
for h in range(H):
for w in range(W):
x=A[h][w]-B[h][w]
for y in d[h][w+1]:
d[h+1][w+1].add((y+x)%(80*H*W))
d[h+1][w+1].add((y-x)%(80*H*W))
for y in d[h+1][w]:
d[h+1][w+1].add((y+x)%(80*H*W))
d[h+1][w+1].add((y-x)%(80*H*W))
for i in range(80*H*W):
if i in d[H][W] or -i in d[H][W]:
print(i)
exit() | p02839 |
h,w = list(map(int, input().split( )))
a = []
b = []
for i in range(h):
ai = list(map(int, input().split( )))
a.append(ai)
for i in range(h):
bi = list(map(int, input().split( )))
for j in range(w):
a[i][j]-=bi[j]
a[i][j] = abs(a[i][j])
###差のmaxまでをlistで確保する代わりに可能な値をsetで保持
dp = [[set() for j in range(w)] for i in range(h)]
dp[0][0].add(a[0][0])
for j in range(1,w):
for k in dp[0][j-1]:
dp[0][j].add(abs(k-a[0][j]))
dp[0][j].add(k+a[0][j])
for i in range(1,h):
for j in range(w):
for k in dp[i-1][j]:
dp[i][j].add(abs(k-a[i][j]))
dp[i][j].add(k+a[i][j])
if j:
for k in dp[i][j-1]:
dp[i][j].add(abs(k-a[i][j]))
dp[i][j].add(k+a[i][j])
#print(dp)
ans = 10**10
for k in dp[h-1][w-1]:
ans = min(ans,k)
print(ans)
|
h,w = list(map(int, input().split( )))
a = []
for i in range(h):
ai = list(map(int, input().split( )))
a.append(ai)
for i in range(h):
bi = list(map(int, input().split( )))
for j in range(w):
a[i][j]-=bi[j]
a[i][j] = abs(a[i][j])
###差のmaxまでをlistで確保する代わりに可能な値をsetで保持
###値が小さいのでsetからbitで保持に変更
dp = [[0 for j in range(w)] for i in range(h)]
a2 = [a[i][j] for i in range(h) for j in range(w)]
mxa = max(a2)
###中心を取る
###間違えやすいし最大値決め打ちか
tmp=1<<mxa*(h+w)+10
dp[0][0]|=tmp<<a[0][0]
dp[0][0]|=tmp>>a[0][0]
for j in range(1,w):
dp[0][j]=dp[0][j-1]<<a[0][j]
dp[0][j]|=dp[0][j-1]>>a[0][j]
for i in range(1,h):
for j in range(w):###ループ一つ抜けてるわw
dp[i][j]=dp[i-1][j]<<a[i][j]
dp[i][j]|=dp[i-1][j]>>a[i][j]
if j:
dp[i][j]|=dp[i][j-1]<<a[i][j]
dp[i][j]|=dp[i][j-1]>>a[i][j]
tmp1 = dp[h-1][w-1]
tmp1>>=mxa*(h+w)+10
###mxa=0でrange(0)になる式だと答えが出ない
for k in range(mxa*(h+w)+10):
if tmp1&1:
print(k)
exit()
tmp1>>=1
| p02839 |
import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in range(h)]
b = [tuple(map(int, input().split())) for _ in range(h)]
c = [[a[i][j] - b[i][j] for j in range(w)] for i in range(h)]
MAX_K = 80 * (h + w) + 5
dp = [[[False] * (MAX_K + 80) for _ in range(w)] for _ in range(h)]
dp[0][0][abs(c[0][0])] = True
for i in range(h):
for j in range(w):
for k in range(MAX_K):
if dp[i][j][k]:
if i < h - 1:
dp[i + 1][j][abs(k + c[i + 1][j])] = True
dp[i + 1][j][abs(k - c[i + 1][j])] = True
if j < w - 1:
dp[i][j + 1][abs(k + c[i][j + 1])] = True
dp[i][j + 1][abs(k - c[i][j + 1])] = True
for k in range(MAX_K):
if dp[h - 1][w - 1][k]:
ans = k
break
print(ans)
| import sys
input = sys.stdin.readline
h, w = list(map(int, input().split()))
a = [tuple(map(int, input().split())) for _ in range(h)]
b = [tuple(map(int, input().split())) for _ in range(h)]
c = [[a[i][j] - b[i][j] for j in range(w)] for i in range(h)]
dp = [[set() for _ in range(w)] for _ in range(h)]
dp[0][0].add(c[0][0])
for i in range(h):
for j in range(w):
for x in dp[i][j]:
if i < h - 1:
dp[i + 1][j].add(abs(x + c[i + 1][j]))
dp[i + 1][j].add(abs(x - c[i + 1][j]))
if j < w - 1:
dp[i][j + 1].add(abs(x + c[i][j + 1]))
dp[i][j + 1].add(abs(x - c[i][j + 1]))
print((min(dp[h - 1][w - 1])))
| p02839 |
h,w = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
g = [[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
g[i][j] = abs(a[i][j] - b[i][j])
a = b = 0
dp = [[[False]*6400 for _ in range(w+1)] for _ in range(h+1)]
dp[0][1][0] = True
dp[1][0][0] = True
for i in range(1,h+1):
for j in range(1,w+1):
for x in range(6400):
if dp[i-1][j][x] or dp[i][j-1][x]:
dp[i][j][abs(x-g[i-1][j-1])] |= True
if x + g[i-1][j-1] < 6400:
dp[i][j][x+g[i-1][j-1]] |= True
for x in range(6400):
if dp[h][w][x]:
print(x)
break
| def fold(x,m):
y = 0
for _ in range(m):
y |= x&1
y <<= 1
x >>= 1
return x|y
lmi = lambda: list(map(int, input().split()))
h,w = lmi()
a = [lmi() for _ in range(2*h)]
g = [[abs(a[i][j] - a[i+h][j]) for j in range(w)] for i in range(h)]
mask = (1<<12801) - 1
dp = [[0]*(w+1) for _ in range(h+1)]
dp[0][0] = 1
for i in range(h):
for j in range(w):
cur,par = g[i][j],dp[i][j]
pos = (par<<cur)|fold(par,cur)
pos &= mask
dp[i+1][j] |= pos
dp[i][j+1] |= pos
for i in range(12801):
if dp[-1][-2]&(1<<i):
print(i)
break
| p02839 |
M = 6400*4
mid = M//2
INF = 10**18
H,W = list(map(int, input().split()))
As = []
for i in range(H):
As.append(list(map(int, input().split())))
diffs = []
for i in range(H):
bs = list(map(int, input().split()))
diffs.append([abs(a-b) for a,b in zip(As[i],bs)])
# bitset高速化
# 初期値
dp = [[0]*W for j in range(H)]
dp[0][0] = 1 << (mid+diffs[0][0]) #プラスマイナス考慮して、下駄をはかせる
for i in range(H):
for j in range(W):
# 行方向
if i+1 < H:
d = diffs[i+1][j]
dp[i+1][j] |= dp[i][j] >> d
dp[i+1][j] |= dp[i][j] << d
# 列方向
if j+1 < W:
d = diffs[i][j+1]
dp[i][j+1] |= dp[i][j] >> d
dp[i][j+1] |= dp[i][j] << d
ans = INF
for i in range(M):
if dp[H-1][W-1] >> i & 1:
# print(i-mid)
ans = min(ans, abs(i-mid))
print(ans) | M = 6400
mid = M//2
INF = 10**18
H,W = list(map(int, input().split()))
As = []
for i in range(H):
As.append(list(map(int, input().split())))
diffs = []
for i in range(H):
bs = list(map(int, input().split()))
diffs.append([abs(a-b) for a,b in zip(As[i],bs)])
# bitset高速化
# 初期値
dp = [[0]*W for j in range(H)]
dp[0][0] = 1 << (mid+diffs[0][0]) #プラスマイナス考慮して、下駄をはかせる
for i in range(H):
for j in range(W):
# 行方向
if i+1 < H:
d = diffs[i+1][j]
dp[i+1][j] |= dp[i][j] >> d
dp[i+1][j] |= dp[i][j] << d
# 列方向
if j+1 < W:
d = diffs[i][j+1]
dp[i][j+1] |= dp[i][j] >> d
dp[i][j+1] |= dp[i][j] << d
ans = INF
for i in range(M):
if dp[H-1][W-1] >> i & 1:
# print(i-mid)
ans = min(ans, abs(i-mid))
print(ans)
| p02839 |
import sys
sys.setrecursionlimit(100000000)
input = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
H,W = list(map(int,input().split()))
A = [tuple(map(int,input().split())) for _ in range(H)]
B = [tuple(map(int,input().split())) for _ in range(H)]
dp = [[[0]*12800 for _ in range(W)] for _ in range(H)]
dp[0][0][6400] = 1
for i in range(H):
for j in range(W):
if i == H - 1 and j == W - 1:
break
a,b = A[i][j],B[i][j]
for k in range(12800):
if dp[i][j][k] == 0:
continue
if 0 <= k + a - b < 12800:
if i + 1 < H:
dp[i + 1][j][k + a - b] |= dp[i][j][k]
if j + 1 < W:
dp[i][j + 1][k + a - b] |= dp[i][j][k]
if 0 <= k - a + b < 12800:
if i + 1 < H:
dp[i + 1][j][k - a + b] |= dp[i][j][k]
if j + 1 < W:
dp[i][j + 1][k - a + b] |= dp[i][j][k]
ans = INF
a,b = A[-1][-1],B[-1][-1]
for i in range(12800):
if (0 <= i + a - b < 12800 and dp[-1][-1][i + a - b]) or (0 <= i - a + b < 12800 and dp[-1][-1][i - a + b]):
ans = min(ans,abs(i - 6400))
print(ans)
if __name__ == '__main__':
main()
| import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
H,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(H)]
B = [list(map(int,input().split())) for _ in range(H)]
dp = [[0]*(1 + W) for _ in range(H + 1)]
x = abs(A[0][0] - B[0][0])
dp[0][0] = 1 << (12800 + x)
dp[0][0] |= 1 << (12800 - x)
for i in range(H):
for j in range(W):
c = abs(A[i][j] - B[i][j])
if i > 0:
dp[i][j] |= dp[i - 1][j] << c
dp[i][j] |= dp[i - 1][j] >> c
if j > 0:
dp[i][j] |= dp[i][j - 1] << c
dp[i][j] |= dp[i][j - 1] >> c
ans = INF
x = dp[H - 1][W - 1]
for i in range(25600):
if x&1:
ans = min(ans,abs(i - 12800))
x >>= 1
print(ans)
if __name__ == '__main__':
main() | p02839 |
def main():
H, W = list(map(int, input().split()))
A = []
for _ in range(H):
A += list(map(int, input().split())) # 速度のため一次元で管理
B = []
for _ in range(H):
B += list(map(int, input().split())) # 速度のため一次元で管理
dp = [0] * (H * W) # 速度のため一次元で管理,dp[pos]:=bit,[-80*H*W,80*H*W]->[0,2*80*H*W]
d = abs(A[0] - B[0])
dp[0] |= 1 << (80 * H * W + d)
dp[0] |= 1 << (80 * H * W - d)
for r in range(H):
for c in range(W):
p = r * W + c
d = abs(A[p] - B[p])
if r > 0:
dp[p] |= (dp[p - W] << d)
dp[p] |= (dp[p - W] >> d)
if c > 0:
dp[p] |= (dp[p - 1] << d)
dp[p] |= (dp[p - 1] >> d)
ans = 2 * 80 * H * W + 1
for j in range(2 * 80 * H * W + 1):
if (dp[H * W - 1] >> j) & 1:
t = j - 80 * H * W
if ans > abs(t):
ans = abs(t)
print(ans)
if __name__ == '__main__':
main()
| def main():
H, W = list(map(int, input().split()))
MAX_BIAS = 80 * (H + W - 1)
A = []
for _ in range(H):
A += list(map(int, input().split())) # 速度のため一次元で管理
B = []
for _ in range(H):
B += list(map(int, input().split())) # 速度のため一次元で管理
dp = [0] * (H * W) # 速度のため一次元で管理,dp[pos]:=bit,[-80*(H+W-1),80*(H+W-1)]->[0,2*80*(H+W-1)]
dp[0] |= (1 << MAX_BIAS)
for r in range(H):
for c in range(W):
p = r * W + c
d = abs(A[p] - B[p])
x = dp[p]
if r > 0:
x |= dp[p - W]
if c > 0:
x |= dp[p - 1]
dp[p] = (x << d) | (x >> d)
ans = MAX_BIAS
for j in range(2 * MAX_BIAS + 1):
if (dp[H * W - 1] >> j) & 1:
t = j - MAX_BIAS
if ans > abs(t):
ans = abs(t)
print(ans)
if __name__ == '__main__':
main()
| p02839 |
def resolve():
H, W = map(int, input().split())
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
# 移動直前の偏りをkとし、移動先のマス(i, j)
# についてd = abs(A[i][j] - B[i][j])
# とした際に、移動後の偏りをabs(k - d)
# とするかabs(k + d)とするか」を考えることと同値である。
# dp[i][j][k] : マス (i, j) までの経路の偏りが k になることがあるか？
max_k = 160 * 80
dp = [[[False] * (max_k + 1) for _ in range(W + 1)] for _ in range(H + 1)]
dp[0][1][0] = True
dp[1][0][0] = True
for i in range(H):
for j in range(W):
for k in range(max_k + 1):
d = abs(A[i][j] - B[i][j])
# i+1移動
if k + d <= max_k:
dp[i + 1][j + 1][k + d] |= dp[i + 1][j][k]
if abs(k - d) <= max_k:
dp[i + 1][j + 1][abs(k - d)] |= dp[i + 1][j][k]
# j+1移動
if k + d <= max_k:
dp[i + 1][j + 1][k + d] |= dp[i][j + 1][k]
if abs(k - d) <= max_k:
dp[i + 1][j + 1][abs(k - d)] |= dp[i][j + 1][k]
for k in range(max_k + 1):
if dp[H][W][k]:
return print(k)
if __name__ == "__main__":
resolve()
|
def resolve():
# (O):80（縦最大） × 80（横最大） × 80（各マスの最大の偏り）× 160（最大何回移動する必要があるか）
H, W = list(map(int, input().split()))
A = [tuple(map(int, input().split())) for _ in range(H)]
B = [tuple(map(int, input().split())) for _ in range(H)]
Sub = [[0] * W for i in range(H)]
for i in range(H):
for j in range(W):
Sub[i][j] = abs(A[i][j] - B[i][j])
# 移動直前の偏りをkとし、移動先のマス(i, j)
# についてd = abs(A[i][j] - B[i][j])とした際に、
# 移動後の偏りを abs(k - d) とするか abs(k + d) とするか」を考えることと同値である。
# dp[i][j][k] : マス (i, j) までの経路の偏りが k になることがあるか？
# Bitset演算 (3次元TLE)
max_k = 80 * (H + W)
dp = [[0] * W for _ in range(H)]
dp[0][0] = 1 << (max_k + Sub[0][0]) | 1 << (max_k - Sub[0][0])
for i in range(H):
for j in range(W):
d = Sub[i][j]
if i:
dp[i][j] |= dp[i - 1][j] << d | dp[i - 1][j] >> d
if j:
dp[i][j] |= dp[i][j - 1] << d | dp[i][j - 1] >> d
ans = 10 ** 18
for i in range(max_k * 2 + 1):
if dp[H - 1][W - 1] & (1 << i):
ans = min(ans, abs(max_k - i))
print(ans)
if __name__ == "__main__":
resolve()
| p02839 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
h,w = LI()
a = LIR(h)
b = LIR(h)
for i in range(h):
for j in range(w):
a[i][j] -= b[i][j]
if a[i][j] < 0:
a[i][j] *= -1
d = [(0,1),(1,0)]
f = [0 for x in range(w)]
M = (1<<25600)-1
b = 12800
f[0] = (1<<(b+a[0][0]))|(1<<(b-a[0][0]))
for y in range(h):
ny = y+1
nf = [0 for x in range(w)]
for x in range(w):
nx = x+1
if nx < w:
f[nx] |= ((f[x]<<a[y][nx])|(f[x]>>a[y][nx]))
if ny < h:
nf[x] |= ((f[x]<<a[ny][x])|(f[x]>>a[ny][x]))
if ny < h:
f = [i for i in nf]
ans = bin(f[w-1])[2:]
ans = [abs(i-b) for i in range(len(ans)) if ans[len(ans)-i-1] == "1"]
print((min(ans)))
return
#Solve
if __name__ == "__main__":
solve()
| #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
h,w = LI()
a = LIR(h)
b = LIR(h)
for i in range(h):
for j in range(w):
a[i][j] -= b[i][j]
if a[i][j] < 0:
a[i][j] *= -1
d = [(0,1),(1,0)]
f = [0 for x in range(w)]
M = (1<<25600)-1
b = 12800
f[0] = (1<<(b+a[0][0]))|(1<<(b-a[0][0]))
for y in range(h):
ny = y+1
nf = [0 for x in range(w)]
for x in range(w):
nx = x+1
if nx < w:
f[nx] |= ((f[x]<<a[y][nx])|(f[x]>>a[y][nx]))
f[nx] &= M
if ny < h:
nf[x] |= ((f[x]<<a[ny][x])|(f[x]>>a[ny][x]))
nf[x] &= M
if ny < h:
f = [i for i in nf]
ans = bin(f[w-1])[2:]
ans = [abs(i-b) for i in range(len(ans)) if ans[len(ans)-i-1] == "1"]
print((min(ans)))
return
#Solve
if __name__ == "__main__":
solve()
| p02839 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def build_grid(H, W, intv, _type, space=True, padding=False):
# 入力がスペース区切りかどうか
if space:
_input = lambda: input().split()
else:
_input = lambda: eval(input())
_list = lambda: list(map(_type, _input()))
# 余白の有無
if padding:
offset = 1
else:
offset = 0
grid = list2d(H+offset*2, W+offset*2, intv)
for i in range(offset, H+offset):
row = _list()
for j in range(offset, W+offset):
grid[i][j] = row[j-offset]
return grid
H, W = MAP()
MAXV = 160 * 80
grid1 =build_grid(H, W, 0, int)
grid2 =build_grid(H, W, 0, int)
grid = list2d(H+1, W+1, 0)
for i in range(H):
for j in range(W):
grid[i][j] = abs(grid1[i][j]-grid2[i][j])
dp = list3d(H+1, W+1, MAXV+1, 0)
dp[0][0][0] = 1
for i in range(H):
for j in range(W):
v = grid[i][j]
for k in range(MAXV+1):
if (i+j+1) * 80 < k:
break
dp[i+1][j][abs(k-v)] |= dp[i][j][k]
if k+v <= MAXV:
dp[i+1][j][k+v] |= dp[i][j][k]
dp[i][j+1][abs(k-v)] |= dp[i][j][k]
if k+v <= MAXV:
dp[i][j+1][k+v] |= dp[i][j][k]
ans = INF
for k in range(MAXV+1):
if dp[H][W-1][k]:
ans = min(ans, k)
if dp[H-1][W][k]:
ans = min(ans, k)
print(ans)
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def build_grid(H, W, intv, _type, space=True, padding=False):
# 入力がスペース区切りかどうか
if space:
_input = lambda: input().split()
else:
_input = lambda: eval(input())
_list = lambda: list(map(_type, _input()))
# 余白の有無
if padding:
offset = 1
else:
offset = 0
grid = list2d(H+offset*2, W+offset*2, intv)
for i in range(offset, H+offset):
row = _list()
for j in range(offset, W+offset):
grid[i][j] = row[j-offset]
return grid
H, W = MAP()
MAXV = 160 * 80
grid1 =build_grid(H, W, 0, int)
grid2 =build_grid(H, W, 0, int)
grid = list2d(H+1, W+1, 0)
for i in range(H):
for j in range(W):
grid[i+1][j+1] = abs(grid1[i][j]-grid2[i][j])
dp = list2d(H+1, W+1, 0)
dp[1][1] = (1<<MAXV-grid[1][1]) | (1<<MAXV+grid[1][1])
for i in range(1, H+1):
for j in range(1, W+1):
v = grid[i][j]
dp[i][j] |= dp[i-1][j] << v
dp[i][j] |= dp[i-1][j] >> v
dp[i][j] |= dp[i][j-1] << v
dp[i][j] |= dp[i][j-1] >> v
ans = INF
S = dp[H][W] >> MAXV
for k in range(MAXV+1):
if S & (1<<k):
ans = min(ans, k)
print(ans)
| p02839 |
#!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/g.inp"; exit $?
exit 0
'''
import sys
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return [ int(x) for x in sys.stdin.readline().strip().split() ]
# read input
h,w = _ia()
ab = []
for _ in range(h): ab.append(_ia())
for i in range(h):
r = ab[i]
for j,bj in enumerate(_ia()):
r[j] = abs(r[j] - bj)
t = max(r)
# initialize
dp = [[None for _ in range(w)] for _ in range(h)]
dp[0][0] = {ab[0][0]}
for ij in range(1,h+w-1):
for i in range(min(ij+1,h)):
j = ij - i
if j>=w: continue
#
x = ab[i][j]
nxt = dp[i][j] = set()
if i==0: ref= dp[i][j-1]
elif j==0: ref = dp[i-1][j]
else: ref = dp[i][j-1] | dp[i-1][j]
#
im = 0
for idx in ref: nxt|= {abs(idx-x),idx+x}
# stdout
ref=dp[h-1][w-1]
print((min(ref)))
| #!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/g.inp"; exit $?
exit 0
'''
import sys
def _ia(): return [ int(x) for x in sys.stdin.readline().strip().split() ]
# read input
h,w = _ia()
ab = []
for _ in range(h): ab.append(_ia())
for i in range(h):
r = ab[i]
for j,bj in enumerate(_ia()):
r[j] = abs(r[j] - bj)
t = max(r)
# initialize
dp = [[None for _ in range(w)] for _ in range(h)]
dp[0][0] = {ab[0][0]}
hw1 = h + w - 1
for ij in range(1,hw1):
iend = ( hw1 - ij ) * 80
for i in range(min(ij+1,h)):
j = ij - i
if j>=w: continue
#
ref = set()
if i>0: ref|= dp[i-1][j]
if j>0: ref|= dp[i][j-1]
#
x = ab[i][j]
nxt = dp[i][j] = set()
for idx in ref:
ix = abs(idx-x)
if ix<=iend: nxt.add(ix)
ix = idx + x
if ix<=iend: nxt.add(ix)
# stdout
print((min(dp[h-1][w-1])))
| p02839 |
h, w = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(h)]
b = [list(map(int,input().split())) for i in range(h)]
ab = [[0]*w for i in range(h)]
for ch in range(h):
for cw in range(w):
ab[ch][cw] = abs(a[ch][cw] - b[ch][cw])
ab0 = ab[0][0]
size = 80*(h+w)
dp = [[0]*w for hh in range(h)]
dp[0][0] |= 2**(size + ab0)
dp[0][0] |= 2**(size - ab0)
for ch in range(h):
for cw in range(w):
if ch < h-1:
dp[ch+1][cw] |= dp[ch][cw] << ab[ch+1][cw]
dp[ch+1][cw] |= dp[ch][cw] >> ab[ch+1][cw]
if cw < w-1:
dp[ch][cw+1] |= dp[ch][cw] << ab[ch][cw+1]
dp[ch][cw+1] |= dp[ch][cw] >> ab[ch][cw+1]
a = dp[h-1][w-1]>>size
m = a&(-a)
print((m.bit_length()-1)) | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
h, w = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(h)]
b = [list(map(int,input().split())) for i in range(h)]
ab = [[0]*w for i in range(h)]
for ch in range(h):
for cw in range(w):
ab[ch][cw] = abs(a[ch][cw] - b[ch][cw])
ab0 = ab[0][0]
size = 80*(h+w)
dp = [[0]*w for hh in range(h)]
dp[0][0] |= 2**(size + ab0)
dp[0][0] |= 2**(size - ab0)
for ch in range(h):
for cw in range(w):
if ch < h-1:
dp[ch+1][cw] |= dp[ch][cw] << ab[ch+1][cw]
dp[ch+1][cw] |= dp[ch][cw] >> ab[ch+1][cw]
if cw < w-1:
dp[ch][cw+1] |= dp[ch][cw] << ab[ch][cw+1]
dp[ch][cw+1] |= dp[ch][cw] >> ab[ch][cw+1]
a = dp[h-1][w-1]>>size
m = a&(-a)
print((m.bit_length()-1)) | p02839 |
h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for i in range(h)]
b=[list(map(int,input().split()))for i in range(h)]
c=[[abs(a[i][j]-b[i][j])for j in range(w)]for i in range(h)]
d=[[set()for i in range(w+1)]for j in range(h+1)]
d[1][1]=set([-c[0][0],c[0][0]])
for x in range(1,h+1):
for y in range(1,w+1):
if not (x==1 and y==1):
a=d[x-1][y]|d[x][y-1]
for i in a:
d[x][y].add(i-c[x-1][y-1])
if i+c[x-1][y-1]<=80:
d[x][y].add(i+c[x-1][y-1])
print((abs(min(d[h][w],key=abs)))) | h,w=list(map(int,input().split()))
a=[list(map(int,input().split()))for i in range(h)]
b=[list(map(int,input().split()))for i in range(h)]
s=[0]*w
s[0]=p=1<<6400
for i in range(h):
for j in range(w):
d=abs(a[i][j]-b[i][j])
if j>0:
s[j]|=s[j-1]
s[j]=(s[j]<<d)|(s[j]>>d)
t=s[-1]
for i in range(6401):
if t&(p<<i) or t&(p>>i):
print(i)
break | p02839 |
# -*- coding: utf-8 -*-
import sys
from collections import deque
H,W=list(map(int, sys.stdin.readline().split()))
A=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
B=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
for h in range(H):
for w in range(W):
A[h][w]=abs(A[h][w]-B[h][w])
dp=[ [ 0 for _ in range(W) ] for __ in range(H) ]
Center=80*80 #中心地のセット マイナスの値もセットできるようにbitsetのゼロを80*80+1桁目に置く
#初期化
r,c=0,0
val=A[r][c]
dp[r][c]=1<<val+Center
q=deque()
q.append((0,0))
D=[(1,0),(0,1)]
Visit={} #訪問済みの頂点にフラグ1を立てる
Visit[(0,0)]=1
while q:
r,c=q.popleft()
for dr,dc in D:
if r+dr<H and c+dc<W:
next_r=r+dr
next_c=c+dc
next_val=A[next_r][next_c]
dp[next_r][next_c]|=dp[r][c]<<next_val
dp[next_r][next_c]|=dp[r][c]>>next_val
Visit[(next_r,next_c)]=1 #次の頂点をキューに入れたら、訪問済みに印をつける
q.append((next_r,next_c))
ans=float("inf")
for i in range(80*80*2):
bit=dp[H-1][W-1]>>i&1
if bit==1:
ans=min(ans,abs(i-Center))
print(ans)
| # -*- coding: utf-8 -*-
import sys
from collections import deque,defaultdict
H,W=list(map(int, sys.stdin.readline().split()))
A=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
B=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
for h in range(H):
for w in range(W):
A[h][w]=abs(A[h][w]-B[h][w])
dp=[ [ 0 for _ in range(W) ] for __ in range(H) ]
Center=80*80 #中心地のセット マイナスの値もセットできるようにbitsetのゼロを80*80+1桁目に置く
#初期化
r,c=0,0
val=A[r][c]
dp[r][c]=1<<val+Center
q=deque()
q.append((0,0))
D=[(1,0),(0,1)]
Visit=defaultdict(lambda: 0) #訪問済みの頂点にフラグ1を立てる
Visit[(0,0)]=1
D=[(1,0),(0,1)]
for r in range(H):
for c in range(W):
for dr,dc in D: #横に1つ移動か、下に1つ移動
if r+dr<H and c+dc<W: #移動しようとするマスが存在するならばif文内の処理を行う
next_r=r+dr
next_c=c+dc
next_val=A[next_r][next_c]
dp[next_r][next_c]|=dp[r][c]<<next_val #次のマスの値が+の場合は、bitshift全体を左にシフト
dp[next_r][next_c]|=dp[r][c]>>next_val #次のマスの値が-の場合は、bitshift全体を右にシフト
q.append((next_r,next_c))
ans=float("inf")
for i in range(Center*2):
bit=dp[H-1][W-1]>>i&1
if bit==1:
ans=min(ans,abs(i-Center))
print(ans)
| p02839 |
# -*- coding: utf-8 -*-
import sys
H,W=list(map(int, sys.stdin.readline().split()))
A=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
B=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
for h in range(H):
for w in range(W):
A[h][w]=abs(A[h][w]-B[h][w])
dp=[ [ 0 for _ in range(W) ] for __ in range(H) ]
Center=80*80 #中心地のセット マイナスの値もセットできるようにbitsetのゼロを80*80+1桁目に置く
#初期化
r,c=0,0
val=A[r][c]
dp[r][c]=1<<val+Center
D=[(1,0),(0,1)]
for r in range(H):
for c in range(W):
for dr,dc in D: #下に1つ移動したマス、右に1つ移動したマス
if r+dr<H and c+dc<W: #下のマスor右のマスが存在するならばif文内の処理を行う
next_r=r+dr
next_c=c+dc
next_val=A[next_r][next_c]
dp[next_r][next_c]|=dp[r][c]<<next_val #次のマスの値が+の場合は、bitshift全体を左にシフト
dp[next_r][next_c]|=dp[r][c]>>next_val #次のマスの値が-の場合は、bitshift全体を右にシフト
ans=float("inf")
for i in range(Center*2):
bit=dp[H-1][W-1]>>i&1
if bit==1:
ans=min(ans,abs(i-Center))
print(ans)
| # -*- coding: utf-8 -*-
import sys
H,W=list(map(int, sys.stdin.readline().split()))
A=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
B=[ list(map(int, sys.stdin.readline().split())) for _ in range(H) ]
for h in range(H):
for w in range(W):
A[h][w]=abs(A[h][w]-B[h][w])
dp=[ [ 0 for _ in range(W) ] for __ in range(H) ]
Center=80*80 #中心地のセット マイナスの値もセットできるようにbitsetのゼロを80*80+1桁目に置く
#初期化
r,c=0,0
val=A[r][c]
dp[r][c]=1<<val+Center
D=[(1,0),(0,1)]
for r in range(H):
for c in range(W):
for dr,dc in D: #下に1つ移動したマス、右に1つ移動したマス
if r+dr<H and c+dc<W: #下のマス or 右のマスが存在するならばif文内の処理を行う
next_r=r+dr
next_c=c+dc
next_val=A[next_r][next_c]
dp[next_r][next_c]|=dp[r][c]<<next_val #次のマスの値が+の場合は、bitshift全体を左にシフト
dp[next_r][next_c]|=dp[r][c]>>next_val #次のマスの値が-の場合は、bitshift全体を右にシフト
ans=float("inf")
for i in range(Center*2):
bit=dp[H-1][W-1]>>i&1
if bit==1:
ans=min(ans,abs(i-Center))
print(ans)
| p02839 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.