#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=5050;
int n,m,k,g[N][N];
char s[N],pt[N];
bool dp[N][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);
}
scanf("%s",pt+1);
rep(i,1,n+1) rep(j,1,m+1) if (g[i][j]) dp[i][j][1]=true;
rep(x,1,k+1) {
rep(i,1,n+1) rep(j,1,m+1) if (g[i][j]==1&&dp[i][j][x&1]) {
if ((pt[x]=='N'||pt[x]=='?')&&g[i-1][j]==1) dp[i-1][j][(x+1)&1]=true;
if ((pt[x]=='S'||pt[x]=='?')&&g[i+1][j]==1) dp[i+1][j][(x+1)&1]=true;
if ((pt[x]=='E'||pt[x]=='?')&&g[i][j+1]==1) dp[i][j+1][(x+1)&1]=true;
if ((pt[x]=='W'||pt[x]=='?')&&g[i][j-1]==1) dp[i][j-1][(x+1)&1]=true;
}
rep(i,1,n+1) rep(j,1,m+1) dp[i][j][x&1]=false;
}
// rep(x,1,k+2) {
// printf("Moves: %d\n",x-1);
// rep(i,1,n+1) {
// rep(j,1,m+1) printf("%d",dp[i][j][x]);
// puts("");
// }
// }
int ans=0;
rep(i,1,n+1) rep(j,1,m+1) if (dp[i][j][(k+1)&1]) ans++;
printf("%d",ans);
}
Compilation message
nautilus.cpp: In function 'int main()':
nautilus.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
27 | scanf("%d%d%d",&n,&m,&k);
| ~~~~~^~~~~~~~~~~~~~~~~~~
nautilus.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
29 | scanf("%s",s+1);
| ~~~~~^~~~~~~~~~
nautilus.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf("%s",pt+1);
| ~~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1100 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1100 KB |
Output is correct |
| 8 |
Correct |
8 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
6 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1100 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 14 |
Correct |
11 ms |
1100 KB |
Output is correct |
| 15 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 16 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 17 |
Correct |
7 ms |
1100 KB |
Output is correct |
| 18 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 19 |
Correct |
9 ms |
1184 KB |
Output is correct |
| 20 |
Correct |
5 ms |
1100 KB |
Output is correct |
| 21 |
Correct |
3 ms |
1100 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 2 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1100 KB |
Output is correct |
| 8 |
Correct |
8 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
6 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1100 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 14 |
Correct |
11 ms |
1100 KB |
Output is correct |
| 15 |
Correct |
4 ms |
1100 KB |
Output is correct |
| 16 |
Correct |
2 ms |
1100 KB |
Output is correct |
| 17 |
Correct |
7 ms |
1100 KB |
Output is correct |
| 18 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 19 |
Correct |
9 ms |
1184 KB |
Output is correct |
| 20 |
Correct |
5 ms |
1100 KB |
Output is correct |
| 21 |
Correct |
3 ms |
1100 KB |
Output is correct |
| 22 |
Execution timed out |
1080 ms |
5708 KB |
Time limit exceeded |
| 23 |
Halted |
0 ms |
0 KB |
- |
