30pts求调
  • 板块P1605 迷宫
  • 楼主LLR_24093789
  • 当前回复3
  • 已保存回复3
  • 发布时间2024/8/20 16:36
  • 上次更新2024/8/20 19:02:39
查看原帖
30pts求调
433415
LLR_24093789楼主2024/8/20 16:36
#include<bits/stdc++.h>
using namespace std;
inline int read(){
	register int x=0,k=1;register char ch=getchar();
	while(!isdigit(ch)){k=-1;ch=getchar();}
	while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return x*k;
}
int n,m,t,sx,sy,fx,fy,ans;
int px[5]={1,-1,0,0},py[5]={0,0,-1,1};
bitset<10> vis[10];
void dfs(int x,int y)
{
	if(x==fx&&y==fy){
		ans++;
		return ;
	}
	int nx,ny;
	for(int i=0;i<4;++i)
	{
		nx=x+px[i],ny=y+py[i];
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m)
		{
			if(!vis[nx][ny])
			{
				vis[nx][ny]=1;
				dfs(nx,ny);
				vis[nx][ny]=0;
			}
		}
	}
}
signed main()
{
	int x,y;
	n=read(),m=read(),t=read();
	sx=read(),sy=read(),fx=read(),fy=read();
	for(register int i=1;i<=t;++i) x=read(),y=read(),vis[x][y]=1;
	dfs(sx,sy);
	printf("%d",ans);
	return 0;
}
2024/8/20 16:36
加载中...