P11228地图探险

#include<iostream>
#define QwQ "return";
using namespace std;
int T,n,m,k,x,y,d,cnt=1;
char P[1010][1010];
bool f[1010][1010];
void go(int x,int y,int d){
	if(d==0&&x>=1&&x<=n&&y+1>=1&&y+1<=m&&P[x][y+1]=='.'&&f[x][y+1]==0) y++,cnt++,f[x][y]==1;
	else if(d==1&&x+1>=1&&x+1<=n&&y>=1&&y<=m&&P[x+1][y]=='.'&&f[x][y+1]==0) x++,cnt++,f[x][y]==1;
	else if(d==2&&x>=1&&x<=n&&y-1>=1&&y-1<=m&&P[x][y-1]=='.'&&f[x][y+1]==0) y--,cnt++,f[x][y]==1;
	else if(d==3&&x-1>=1&&x-1<=n&&y>=1&&y<=m&&P[x-1][y]=='.'&&f[x][y+1]==0) x--,cnt++,f[x][y]==1;
	else if(!(x>=1||x<=n||y>=1||y<=m||P[x][y]=='.')) d=(d+1)%4;
	return;
}
int main(){
	cin>>T;
	for(int i=1;i<=T;i++){
		cin>>n>>m>>k;
		cin>>x>>y>>d;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cin>>P[i][j];
			}
		}
		for(int i=1;i<=k;i++){
			go(x,y,d);
		}
		cout<<cnt<<endl;
		cnt=1;
	}
	QwQ 0;
}