#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
bitset <512> dp[512], a[512];
int n, m, k;
bitset <512> cur[512];
void solve() {
cin >> n >> m >> k;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
char x;
cin >> x;
a[i][j] = (x == '.');
}
}
string args;
cin >> args;
for(int i = 1; i <= n; ++i) dp[i] = a[i];
for(auto d : args) {
for(int i = 1; i <= n; ++i) cur[i].reset();
if(d == '?' || d == 'N') for(int i = 1; i < n; ++i) cur[i] |= (dp[i + 1]);
if(d == '?' || d == 'S') for(int i = 2; i <= n; ++i) cur[i] |= (dp[i - 1]);
if(d == '?' || d == 'E') for(int i = 1; i <= n; ++i) cur[i] |= (dp[i] << 1);
if(d == '?' || d == 'W') for(int i = 1; i <= n; ++i) cur[i] |= (dp[i] >> 1);
for(int i = 1; i <= n; ++i) dp[i] = cur[i] & a[i];
}
int ans = 0;
for(int i = 1; i <= n; ++i) ans += dp[i].count();
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int CNT_TESTS = 1;
///cin >> CNT_TESTS;
for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
solve();
if(NUMCASE != CNT_TESTS) cout << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
2 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
336 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
2 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
96 ms |
660 KB |
Output is correct |
| 23 |
Correct |
98 ms |
660 KB |
Output is correct |
| 24 |
Correct |
100 ms |
660 KB |
Output is correct |
| 25 |
Correct |
96 ms |
656 KB |
Output is correct |
| 26 |
Correct |
94 ms |
680 KB |
Output is correct |
| 27 |
Correct |
132 ms |
592 KB |
Output is correct |
| 28 |
Correct |
136 ms |
596 KB |
Output is correct |
| 29 |
Correct |
133 ms |
668 KB |
Output is correct |
| 30 |
Correct |
133 ms |
664 KB |
Output is correct |
| 31 |
Correct |
135 ms |
664 KB |
Output is correct |
| 32 |
Correct |
163 ms |
664 KB |
Output is correct |
| 33 |
Correct |
162 ms |
656 KB |
Output is correct |
| 34 |
Correct |
161 ms |
596 KB |
Output is correct |
| 35 |
Correct |
161 ms |
660 KB |
Output is correct |
| 36 |
Correct |
159 ms |
676 KB |
Output is correct |
