考场代码 80求调
查看原帖
考场代码 80求调
1048589
HuangBarry楼主2024/10/27 09:21
#include<bits/stdc++.h>
#define endl '\n'
#define Made return
#define by 0
#define Barry +0
using namespace std;
int t,n,m,k,x,y,d,ans;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
char Map[1111][1111];
bool vis[1111][1111];
void dfs(int xx,int yy,int dd){
	if(!k)
		return;
	for(int i=0;i<4;i++){
		if(i)
			k--;
		int nx=xx+dx[(dd+i)%4];
		int ny=yy+dy[(dd+i)%4];
		if(nx<1||ny<1||nx>n||ny>m||Map[nx][ny]=='x')
			continue;
		else{
			if(!k)
				return;
			k--;
			if(!vis[nx][ny]){
				ans++;
				vis[nx][ny]=1;
			}
			dfs(nx,ny,(dd+i)%4);
			break;
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin>>t;
	while(t--){
		ans=1;
		cin>>n>>m>>k>>x>>y>>d;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++){
				cin>>Map[i][j];
				vis[i][j]=0;
			}
		vis[x][y]=1;
		dfs(x,y,d);
		cout<<ans<<endl;
	}
	Made by Barry;
}
2024/10/27 09:21
加载中...