This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int n,m,p,cnt;
char arr[101][101];
int vis[101][101],dp[101][101][101];
string s;
void solve(int i,int j,int k){
if(i>=n||j>=m||i<0||j<0||arr[i][j]=='#') return;
if(k==p){
if(vis[i][j]!=1) cnt++;
vis[i][j]=1;
return;
}
if(s[k]=='N'||s[k]=='?') solve(i-1,j,k+1);
if(s[k]=='S'||s[k]=='?') solve(i+1,j,k+1);
if(s[k]=='E'||s[k]=='?') solve(i,j+1,k+1);
if(s[k]=='W'||s[k]=='?') solve(i,j-1,k+1);
return;
}
signed main()
{
cin>>n>>m>>p;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) cin>>arr[i][j];
}
cin>>s;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) solve(i,j,0);
}
cout<<cnt<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |