50分求调

#include<iostream>
#include<cstring>
using namespace std;
int t,d,x,y,n,m,k;
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
char map[1010][1010];
bool vis[1010][1010];
int main()
{
	cin >> t;
	while (t--)
	{
		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];
		int sum = 1;
		while (k--)
		{
			int nx = x + dx[d];
			int ny = y + dy[d];
			if (nx < 1 || nx > n || ny<1 || ny > m)
			{
				d = (d + 1) % 4;
				continue;
			}
			if (map[nx][ny] == 'x')
			{
				d = (d + 1) % 4;
				continue;
			}
			if (!vis[nx][ny]) sum++;
			x = nx;
			y = ny;
			vis[nx][ny] = 1;
		}
		memset(map, 0, sizeof(map));
		memset(vis, 0, sizeof(vis));
		cout << sum << endl;
	}


	return 0;
}