有没有大佬帮我看一下这道题P1006 两次提交都是20分 吐了

#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stack>
#include<queue>
#define ll long long
using namespace std;
int a,b,map1[1001][1001],c[1001][1001],sum=0;
int fh1(int x,int y){
	if(x+1>a||y+1>b||x<0||y<0){
		return 0;
	}else{
		if(c[x][y]+c[x+1][y]>c[x][y]+c[x][y+1]&&map1[x+1][y]==0){
			sum+=c[x+1][y];
			map1[x+1][y]=1;
			return fh1(x+1,y);
		}else{
			sum+=c[x][y+1];
			map1[x][y+1]=1;
			return fh1(x,y+1);
		}
	}
}
int fh2(int x,int y){
	if(x-1>a||y-1>b||x<0||y<0){
		return 0;
	}else{
		if(c[x][y]+c[x-1][y]>c[x][y]+c[x][y-1]&&map1[x-1][y]==0){
			sum+=c[x-1][y];
			map1[x-1][y]=1;
			return fh2(x-1,y);
		}else{
			sum+=c[x][y-1];
			map1[x][y-1]=1;
			return fh2(x,y-1);
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>a>>b;
	for(int i=0;i<a;i++){
		for(int j=0;j<b;j++){
			cin>>c[i][j];
		}
	}
	fh1(0,0);
	fh2(a-1,b-1);
	cout<<sum;
	return 0;
}