解题思路:
注意事项:
多多优化
参考代码:
n,m = map(int,input().split())
data = [list(map(int,input().split())) for i in range(m)]
sums = sum([sum(data[i]) for i in range(m)])
bools = [[0 for i in range(n)] for j in range(m)]
res = 10000
def search(now,x,y,count,sign):
global res
if now > half or res <= count or bools[x][y]:
return
elif now == half:
res = count
now += data[x][y]
bools[x][y] = 1
count += 1
if sign != "D" and x < m-1:
search(now,x+1,y,count,"U")
if sign != "R" and y < n-1:
search(now,x,y+1,count,"L")
if sign != "L" and y > 0:
search(now,x,y-1,count,"R")
if sign != "U" and x > 0:
search(now,x-1,y,count,"D")
if x < m-1 and y > 0:
search(now,x+1,y-1,count,"LD")
bools[x][y] = 0
if sums%2 != 0:
print(0)
else:
half = sums//2
search(0,0,0,0,"U")
if res == 10000:
print(0)
else:
print(res)
0.0分
2 人评分
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:552 |
Biggest Number (C++代码)回溯法浏览:1612 |
C语言程序设计教程(第三版)课后习题6.11 (C语言代码)for循环浏览:1107 |
简单的a+b (C语言代码)浏览:520 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:1282 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:594 |
剪刀石头布 (C语言代码)浏览:1747 |
WU-整除问题 (C++代码)浏览:611 |
C语言程序设计教程(第三版)课后习题6.6 (C语言代码)浏览:349 |
1009题解浏览:722 |