// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i = l;i<=r;i++) cerr<<a[i]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
return uniform_int_distribution<ll>(l,r)(rng);
}
void setIO(string inoutname)
{
freopen((inoutname+".in").c_str(),"r",stdin);
freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
if(b==0) return a;
if(a==0) return b;
if(a>=b) return gcd(a%b,b);
return gcd(a,b%a);
}
ll lcm(ll a,ll b){
return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
x+=y;
if(x<0){
x%=mod;
x+=mod;
}else{
if(x>=mod) x%=mod;
}
return x;
}
ll mul(ll a,ll b){
ll ans = (a*b)%mod;
if(ans<0) ans+=mod;
return ans;
}
ll po(ll x,ll y){
if(y==0) return 1LL;
ll ans = po(x,y/2);
ans = mul(ans,ans);
if(y&1) ans = mul(ans,x);
return ans;
}
ll inv(ll x){return po(x,mod-2);}
#define maxn 505
#define maxk 5005
ll n,m,k;
bitset<maxn> a[maxn];
bitset<maxn> dp[maxn][2];
void tc(){
cin >> n >> m >> k;
for(ll i = 1;i<=n;i++){
string s; cin >> s;
for(ll j = 1;j<=m;j++){
if(s[j-1]=='.') a[i][j] = 1;
}
}
for(ll i = 1;i<=n;i++){
for(ll j = 1;j<=m;j++){
if(a[i][j]==1) dp[i][0][j] = 1;
}
}
string s; cin >> s;
for(ll ii = 1;ii<=k;ii++){
char c = s[ii-1];
ll e = ii&1;
ll r = e^1;
for(ll i = 1;i<=n;i++){
for(ll j = 1;j<=m;j++) dp[i][e][j] = 0;
}
/*here;
for(ll i = 1;i<=n;i++){
for(ll j = 1;j<=m;j++){
cerr<<dp[i][r][j]<< " ";
}
cerr<<endl;
}*/
for(ll i = 1;i<=n;i++){
if(c=='N'){
dp[i][e] = dp[i+1][r]&a[i];
}else if(c=='S'){
dp[i][e] = dp[i-1][r]&a[i];
}else if(c=='E'){
dp[i][e] = (dp[i][r]<<1)&a[i];
}else if(c=='W'){
dp[i][e] = (dp[i][r]>>1)&a[i];
}else{
dp[i][e] = ((dp[i][r]>>1)|(dp[i][r]<<1)|(dp[i-1][r])|(dp[i+1][r]))&a[i];
}
}
}
//here;
ll ans = 0;
for(ll i = 1;i<=n;i++){
for(ll j = 1;j<=m;j++){
if(dp[i][k&1][j]) ans++;
//cerr<<dp[i][k&1][j]<< " ";
}
//cerr<<endl;
}
cout<<ans<<endl;
}
int main(){
daj_mi_malo_vremena
//setIO("lol");
int t; t = 1;
while(t--){
tc();
}
return 0;
}
/*
5 9 2
...##....
..#.##..#
..#....##
.##...#..
....#....
WS
*/
Compilation message
nautilus.cpp: In function 'void setIO(std::string)':
nautilus.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
48 | freopen((inoutname+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:49:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | freopen((inoutname+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
340 KB |
Output is correct |
| 6 |
Correct |
3 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
340 KB |
Output is correct |
| 6 |
Correct |
3 ms |
212 KB |
Output is correct |
| 7 |
Correct |
4 ms |
340 KB |
Output is correct |
| 8 |
Correct |
3 ms |
340 KB |
Output is correct |
| 9 |
Correct |
4 ms |
340 KB |
Output is correct |
| 10 |
Correct |
3 ms |
332 KB |
Output is correct |
| 11 |
Correct |
3 ms |
340 KB |
Output is correct |
| 12 |
Correct |
4 ms |
340 KB |
Output is correct |
| 13 |
Correct |
4 ms |
340 KB |
Output is correct |
| 14 |
Correct |
3 ms |
340 KB |
Output is correct |
| 15 |
Correct |
3 ms |
340 KB |
Output is correct |
| 16 |
Correct |
3 ms |
340 KB |
Output is correct |
| 17 |
Correct |
3 ms |
356 KB |
Output is correct |
| 18 |
Correct |
3 ms |
340 KB |
Output is correct |
| 19 |
Correct |
3 ms |
332 KB |
Output is correct |
| 20 |
Correct |
4 ms |
340 KB |
Output is correct |
| 21 |
Correct |
4 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
340 KB |
Output is correct |
| 2 |
Correct |
3 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
340 KB |
Output is correct |
| 6 |
Correct |
3 ms |
212 KB |
Output is correct |
| 7 |
Correct |
4 ms |
340 KB |
Output is correct |
| 8 |
Correct |
3 ms |
340 KB |
Output is correct |
| 9 |
Correct |
4 ms |
340 KB |
Output is correct |
| 10 |
Correct |
3 ms |
332 KB |
Output is correct |
| 11 |
Correct |
3 ms |
340 KB |
Output is correct |
| 12 |
Correct |
4 ms |
340 KB |
Output is correct |
| 13 |
Correct |
4 ms |
340 KB |
Output is correct |
| 14 |
Correct |
3 ms |
340 KB |
Output is correct |
| 15 |
Correct |
3 ms |
340 KB |
Output is correct |
| 16 |
Correct |
3 ms |
340 KB |
Output is correct |
| 17 |
Correct |
3 ms |
356 KB |
Output is correct |
| 18 |
Correct |
3 ms |
340 KB |
Output is correct |
| 19 |
Correct |
3 ms |
332 KB |
Output is correct |
| 20 |
Correct |
4 ms |
340 KB |
Output is correct |
| 21 |
Correct |
4 ms |
340 KB |
Output is correct |
| 22 |
Execution timed out |
1090 ms |
596 KB |
Time limit exceeded |
| 23 |
Halted |
0 ms |
0 KB |
- |
