WA20对3 4求解答
查看原帖
WA20对3 4求解答
990278
NEGATUIVE_SEVEN_DL楼主2024/11/4 22:41
#include<bits/stdc++.h>
using namespace std;
int T;
long long n,m,k,x,y,d,cnt;
int book[10005][10005];
char mapn[10005][10005];
int main()
{
//	freopen("explore.in","r",stdin);
//	freopen("explore.out","w",stdout);	
	cin>>T;
	while(T--)
	{
		cnt=0;
		cin>>n>>m>>k;
		cin>>x>>y>>d;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				book[i][j]=0;
			}
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				cin>>mapn[i][j];
			}
		}
		for(int i=1;i<=k;i++)
		{
			int x_1=x,y_1=y;
			if(d==0) y_1=y_1+1;
			else if(d==1) x_1=x_1+1;
			else if(d==2) y_1=y_1-1;
			else if(d==3) x_1=x_1-1;
			if((x<=n&&y<=m)&&(mapn[x_1][y_1]=='.'))
			{
				x=x_1;
				y=y_1;
				book[x][y]=1;
			}
			else d=(d+1)%4;
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				if(book[i][j]==1)
				{
					cnt++;
				}
			}
		}
		cout<<cnt+1<<endl;
	}
	return 0;
}
2024/11/4 22:41
加载中...