#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
const int N=505;
int n,m,k;
char s[N],pt[10*N];
bitset<N> g[N],dp[N][2];
int main() {
scanf("%d%d%d",&n,&m,&k);
rep(i,1,n+1) {
scanf("%s",s+1);
rep(j,1,m+1) g[i][j]=(s[j]=='.'?1:0);
}
rep(i,1,n+1) dp[i][0]=g[i];
scanf("%s",pt+1);
rep(x,1,k+1) {
rep(i,1,n+1) dp[i][1]=dp[i][0];
if (pt[x]=='N') {
rep(i,1,n+1) dp[i][0]=dp[i+1][1];
}
if (pt[x]=='S') {
rep(i,1,n+1) dp[i][0]=dp[i-1][1];
}
if (pt[x]=='W') {
rep(i,1,n+1) dp[i][0]=(dp[i][1]>>1);
}
if (pt[x]=='E') {
rep(i,1,n+1) dp[i][0]=(dp[i][1]<<1);
}
if (pt[x]=='?') {
rep(i,1,n+1) dp[i][0]=dp[i+1][1];
rep(i,1,n+1) dp[i][0]|=dp[i-1][1];
rep(i,1,n+1) dp[i][0]|=(dp[i][1]>>1);
rep(i,1,n+1) dp[i][0]|=(dp[i][1]<<1);
}
rep(i,1,n+1) dp[i][0]&=g[i];
}
int ans=0;
rep(i,1,n+1) ans+=dp[i][0].count();
printf("%d",ans);
}
Compilation message
nautilus.cpp: In function 'int main()':
nautilus.cpp:28:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
28 | scanf("%d%d%d",&n,&m,&k);
| ~~~~~^~~~~~~~~~~~~~~~~~~
nautilus.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | scanf("%s",s+1);
| ~~~~~^~~~~~~~~~
nautilus.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | scanf("%s",pt+1);
| ~~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| 22 |
Correct |
23 ms |
332 KB |
Output is correct |
| 23 |
Correct |
26 ms |
644 KB |
Output is correct |
| 24 |
Correct |
25 ms |
644 KB |
Output is correct |
| 25 |
Correct |
30 ms |
588 KB |
Output is correct |
| 26 |
Correct |
35 ms |
588 KB |
Output is correct |
| 27 |
Correct |
46 ms |
588 KB |
Output is correct |
| 28 |
Correct |
33 ms |
588 KB |
Output is correct |
| 29 |
Correct |
33 ms |
640 KB |
Output is correct |
| 30 |
Correct |
32 ms |
624 KB |
Output is correct |
| 31 |
Correct |
31 ms |
588 KB |
Output is correct |
| 32 |
Correct |
38 ms |
588 KB |
Output is correct |
| 33 |
Correct |
39 ms |
588 KB |
Output is correct |
| 34 |
Correct |
44 ms |
588 KB |
Output is correct |
| 35 |
Correct |
61 ms |
588 KB |
Output is correct |
| 36 |
Correct |
38 ms |
588 KB |
Output is correct |
