P1002 [NOIP2002 普及组] 过河卒

目录

总结：

DFS(超时):

AC代码(DP)：

---

总结：

           用  dfs  容易超时，可以尝试改为DP。

           输出结果的数据类型为  long long 

DFS(超时):

#include <bits/stdc++.h>
using namespace std;
struct site{
	int x,y;
};
site final,horse;
int h_x[]={-2,-2,-1,-1,1,1,2,2};
int h_y[]={-1,1,-2,2,-2,2,-1,1};
vector<vector<int> >flag;
void judge(){
	flag[horse.x][horse.y ]=1;
	for(int i=0;i<8;i++){
		if(horse.x+h_x[i]>=0&&horse.y+h_y[i]>=0&&horse.x+h_x[i]<=final.x &&horse.y+h_y[i]<=final.y)flag[horse.x+h_x[i]][horse.y+h_y[i]]=1;
	}
}
int ans=0;
void dfs(int x,int y){
	if(x==final.x &&y==final.y){
		ans++;
		return ;
	}
	if(x<final.x&&!flag[x+1][y]){
		flag[x+1][y]=1;
		dfs(x+1,y);
		flag[x+1][y]=0;
	}
	if(y<final.y &&!flag[x][y+1]){
		flag[x][y+1]=1;
		dfs(x,y+1);
		flag[x][y+1]=0;
	}
	
}
int main() {
	cin>>final.x >>final.y>>horse.x>>horse.y;
	flag.resize(final.x+1,vector<int>(final.y+1));
	for(int i=0;i<flag.size();i++){
		for(int j=0;j<flag[i].size();j++){
			flag[i][j]=0;
		}
	}
	judge();
	dfs(0,0);
	cout<<ans;
}

AC代码(DP)：

#include <bits/stdc++.h>
using namespace std;
struct site{
	int x,y;
};
site final,horse;
int h_x[]={-2,-2,-1,-1,1,1,2,2};
int h_y[]={-1,1,-2,2,-2,2,-1,1};
vector<vector<int> >flag;
void judge(){    //马能到达的坐标 flag=1
	flag[horse.x][horse.y]=1;
	for(int i=0;i<8;i++){
		if(horse.x+h_x[i]>=0&&horse.y+h_y[i]>=0&&horse.x+h_x[i]<=final.x &&horse.y+h_y[i]<=final.y)flag[horse.x+h_x[i]][horse.y+h_y[i]]=1;
	}
}

int main() {
	cin>>final.x >>final.y>>horse.x>>horse.y;
	flag.resize(final.x+1,vector<int>(final.y+1));
	vector<vector<long long> >dp(final.x+1,vector<long long>(final.y+1));
	
	for(int i=0;i<flag.size();i++){
		for(int j=0;j<flag[i].size();j++){
			flag[i][j]=0;
			dp[i][j]=0;
		}
	}
	
	judge();
	for(int i=0;i<=final.x;i++){
		if(!flag[i][0])dp[i][0]=1;
		else break;
	}
	for(int j=0;j<=final.y;j++){
		if(!flag[0][j])dp[0][j]=1;
		else break;
	} 
	for(int i=1;i<=final.x;i++){
		for(int j=1;j<=final.y;j++){
			if(!flag[i][j]){
				dp[i][j]=dp[i][j-1]+dp[i-1][j];
			}
		}
	}
	cout<<dp[final.x][final.y]<<endl;
}