蒟蒻递推解法,为啥1RE 2AC 2WA
查看原帖
蒟蒻递推解法,为啥1RE 2AC 2WA
1359133
future666楼主2024/9/16 12:47

这题我不会动规啊!怎么办! 我(灵机一damn):逝逝暴力递推! 于是... 40分代码:

#include<bits/stdc++.h>
int n,m,x,y,ans,a[30][30]={0};
using namespace std;
int main(){
    cin>>n>>m>>x>>y;
    for(int i=0;i<=n;i++){
    	for(int j=0;j<=m;j++){
    		a[i][j]=1;
		}
	}
    a[x][y]=0;
   if(x+2<=n&&y-1>=0) a[x+2][y-1]=0;
   if(x+2<=n&&y+1<=m) a[x+2][y+1]=0;
	if(x-2>=0&&y+1<=m) a[x-2][y+1]=0;
	if(x-2>=0&&y-1>=0) a[x-2][y-1]=0;
	if(x+1>=0&&y+2<=m) a[x-1][y+2]=0;
	if(x-1>=0&&y-2>=0) a[x+1][y-2]=0;
	if(x+1<=n&&y-2>=0) a[x-1][y-2]=0;
	if(x-1<=n&&y+2<=m) a[x+1][y+2]=0;	
    for(int i=0;i<=n;i++){
    	for(int j=0;j<=m;j++){
    		if(i==0&&j==0) continue;
    		if(a[i][j]==0) continue;
    		if(i==0) a[i][j]=a[i][j-1];
    		else if(j==0) a[i][j]=a[i-1][j];
    		else{
    			a[i][j]=a[i-1][j]+a[i][j-1];
			}
		}
	}
	cout<<a[n][m];
    return 0;
}

你就说暴力不暴力吧 但这60分怎么办捏?

2024/9/16 12:47
加载中...