~1. ~#include<bits/stdc++.h> #include using namespace std; const int N=1010; char mp[N][N]; bool st[N][N]; int dx[]={0,1,0,-1},dy[]={1,0,-1,0}; int main(){ int t; cin>>t; while(t--){ int n,m,k,x,y,d; cin>>n>>m>>k>>x>>y>>d; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>mp[i][j]; } } int ans=1; st[x][y]=true; while(k--){ int a=x+dx[d],b=y+dy[d]; if(a>=1 && a<=n && b>=1 && b<=m && mp[a][b]=='.') { x=a,y=b; if(!st[a][b]){ ans++; st[a][b]=true; } }else d=(d+1)%4; } cout<<ans<<endl; memset(st,0,sizeof(st)); } return 0; }

不知道有什么难的······

#include <iostream>
#include <cstring>
using namespace std;
const int N = 1010;
char mp[N][N];
bool st[N][N];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int main()
{
	int t;
	cin >> t;
	while(t --)
	{
		int n, m, k, x, y, d;
		cin >> n >> m >> k >> x >> y >> d;
		for(int i = 1;i <= n;i ++)
			for(int j = 1;j <= m;j ++)
				cin >> mp[i][j];
		int ans = 1;
		st[x][y] = true;
		while(k --)
		{
			int a = x + dx[d], b = y + dy[d];
			if(a >= 1 && a <= n && b >= 1 && b <= m && mp[a][b] == '.')
			{
				x = a, y = b;
				if(!st[a][b])
				{
					ans ++;
					st[a][b] = true;
				}
			}
			else d = (d + 1) % 4;
		}
		cout << ans << endl;
		memset(st, 0, sizeof(st));
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
char mp[1100][1100];
bool vis[1100][1100]; 
int main(){
	int t;
	cin>>t;
	while(t--){
		memset(vis,0,sizeof vis);
		memset(mp,0,sizeof mp);
		int n,m,k,x,y,d;
		cin>>n>>m>>k>>x>>y>>d;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				cin>>mp[i][j];
			
		int step=1;
		vis[x][y]=1;
		while(k--){
			int tx=x+dx[d],ty=y+dy[d];
			if(mp[tx][ty]=='.'){
				if(vis[tx][ty]==0)
					step++,vis[tx][ty]=1;
				x=tx,y=ty;
			}else{
				d=(d+1)%4;
			}
		}
		cout<<step<<endl;
	}
	                         
	return 0;
}