C++ 解法, 执行用时: 664ms, 内存消耗: 70932K, 提交时间: 2023-08-13 13:36:48

#include<bits/stdc++.h>
using namespace std;
const int mod=2333;
int m,n,mapp[3005][3005],dp[3005][3005];
int main()
{
	scanf("%d%d",&m,&n);
	dp[m+1][1]=1;
	for(int i=1;i<=m;i++)
	for(int j=1;j<=n;j++)scanf("%d",&mapp[i][j]);
	for(int i=m;i>=1;i--){
		for(int j=1;j<=n;j++){
			if(mapp[i][j]==0)dp[i][j]=(dp[i+1][j]+dp[i][j-1])%mod;
		}
	}
	cout<<dp[1][n];
	return 0;
}

Java 解法, 执行用时: 1784ms, 内存消耗: 174316K, 提交时间: 2023-08-13 13:36:14

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt(), n = sc.nextInt();
		int[][] mp = new int[n][m],dp = new int[n][m];
        sc.nextLine();
		for (int i = 0; i < m; i++) 
			mp[i] = Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();

		for (int i = n-1; i >= 0; i--) {
			if(mp[i][0] == 1)
				break;
			dp[i][0] = 1;
		}
		for (int j = 1; j < n; j++) {
			if(mp[n-1][j] == 1)
				break;
			dp[n-1][j] = 1;
		}
		for (int i = n-2; i >= 0; i--) {
			for (int j = 1; j < n; j++) {
				if(mp[i][j] == 0){
					dp[i][j] += (dp[i+1][j]+dp[i][j-1])%2333;
				}
			}
		}
		System.out.println(dp[0][n-1]);
	}
}