解题思路:
注意事项:
多多优化
参考代码:
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分
1 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复