Atcoder Beginner Contest 341C Takahashi Gets Lost

problem link

Since $n\le 500$, an brute force implementation of complexity $\mathcal{O}(n^3)$ would suffice. For each legal starting point, we caculate its position on each of the $n$ steps and check if they are legal.

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
const int Maxn=510;
const int dx[]={1,-1,0,0},dy[]={0,0,-1,1};
char a[Maxn][Maxn],s[Maxn];
int f[Maxn];
int n,m,q,ans;
inline int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
	return s*w;
}
bool work(int x,int y)
{
	if(a[x][y]=='#')return 0;
	for(int i=1;i<=q;++i)
	{
		x+=dx[f[i]],y+=dy[f[i]];
		if(a[x][y]=='#')return 0;
	}
	return 1;
}
int main()
{
	// freopen("in.txt","r",stdin);
	n=read(),m=read(),q=read();
	scanf("%s",s+1);
	for(int i=1;i<=q;++i)
	{
		if(s[i]=='L')f[i]=2;
		if(s[i]=='R')f[i]=3;
		if(s[i]=='U')f[i]=1;
		if(s[i]=='D')f[i]=0;
	}
	for(int i=1;i<=n;++i)
	scanf("%s",a[i]+1);
	for(int i=1;i<=n;++i)
	for(int j=1;j<=m;++j)
	if(work(i,j))++ans;
	printf("%d\n",ans);
	return 0;
}