蒟蒻dfs样例过不了,995
查看原帖
蒟蒻dfs样例过不了,995
932569
I_AM_Nigger楼主2023/6/16 12:48
#include<bits/stdc++.h>
using namespace std;
int tx[4] = {1,2,-1,-2};
int ty[4] = {2,1, 2, 1};
int vis[1010][1010];
int m,n,ans;
int dfs(int x,int y)
{
//	cout << x << " " << y <<'\n';
	if(x == n && y == m)
	{
		ans++;
		return 0;
	}
	if(x > n || y > m)
	{
		return 0;
	}
	for(int i = 0;i<4;i++)
	{
		int nx = x+tx[i];int ny = y+ ty[i];
		if(nx >= 1 && ny >= 1 && nx <= n && ny <= m && vis[nx][ny] == 0)
		{
			vis[nx][ny] = 1;
			dfs(nx,ny);
			vis[nx][ny] = 0;
		}
	}
	return 0;
}
int main()
{
	cin >> n >> m;
	dfs(1,1);
	cout << ans << '\n';
	return 0;
}

气死我了!!

2023/6/16 12:48
加载中...