#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, op; cin >> n >> m >> op; n += 2, m += 2; bitset<255000> dp, ok;
for (int i = 1; i < n - 1; i++)
for (int j = 1; j < m - 1; j++){
char c; cin >> c;
if (c == '.') dp[i * m + j] = ok[i * m + j] = 1;
}
for (int i = 0; i < op; i++){
char c; cin >> c;
if (c == 'N') dp >>= m;
if (c == 'S') dp <<= m;
if (c == 'W') dp >>= 1;
if (c == 'E') dp <<= 1;
if (c == '?') dp = (dp << m) | (dp >> m) | (dp << 1) | (dp >> 1);
dp &= ok;
}
cout<<dp.count()<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
460 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
460 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
460 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
460 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
7 |
Correct |
3 ms |
588 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
3 ms |
588 KB |
Output is correct |
10 |
Correct |
4 ms |
580 KB |
Output is correct |
11 |
Correct |
3 ms |
576 KB |
Output is correct |
12 |
Correct |
4 ms |
604 KB |
Output is correct |
13 |
Correct |
5 ms |
588 KB |
Output is correct |
14 |
Correct |
5 ms |
716 KB |
Output is correct |
15 |
Correct |
5 ms |
576 KB |
Output is correct |
16 |
Correct |
5 ms |
588 KB |
Output is correct |
17 |
Correct |
6 ms |
588 KB |
Output is correct |
18 |
Correct |
5 ms |
576 KB |
Output is correct |
19 |
Correct |
6 ms |
588 KB |
Output is correct |
20 |
Correct |
6 ms |
588 KB |
Output is correct |
21 |
Correct |
6 ms |
588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
460 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
460 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
7 |
Correct |
3 ms |
588 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
3 ms |
588 KB |
Output is correct |
10 |
Correct |
4 ms |
580 KB |
Output is correct |
11 |
Correct |
3 ms |
576 KB |
Output is correct |
12 |
Correct |
4 ms |
604 KB |
Output is correct |
13 |
Correct |
5 ms |
588 KB |
Output is correct |
14 |
Correct |
5 ms |
716 KB |
Output is correct |
15 |
Correct |
5 ms |
576 KB |
Output is correct |
16 |
Correct |
5 ms |
588 KB |
Output is correct |
17 |
Correct |
6 ms |
588 KB |
Output is correct |
18 |
Correct |
5 ms |
576 KB |
Output is correct |
19 |
Correct |
6 ms |
588 KB |
Output is correct |
20 |
Correct |
6 ms |
588 KB |
Output is correct |
21 |
Correct |
6 ms |
588 KB |
Output is correct |
22 |
Correct |
108 ms |
832 KB |
Output is correct |
23 |
Correct |
110 ms |
804 KB |
Output is correct |
24 |
Correct |
110 ms |
828 KB |
Output is correct |
25 |
Correct |
105 ms |
856 KB |
Output is correct |
26 |
Correct |
104 ms |
936 KB |
Output is correct |
27 |
Correct |
187 ms |
800 KB |
Output is correct |
28 |
Correct |
180 ms |
844 KB |
Output is correct |
29 |
Correct |
179 ms |
844 KB |
Output is correct |
30 |
Correct |
176 ms |
824 KB |
Output is correct |
31 |
Correct |
175 ms |
824 KB |
Output is correct |
32 |
Correct |
228 ms |
812 KB |
Output is correct |
33 |
Correct |
230 ms |
844 KB |
Output is correct |
34 |
Correct |
229 ms |
844 KB |
Output is correct |
35 |
Correct |
229 ms |
836 KB |
Output is correct |
36 |
Correct |
225 ms |
844 KB |
Output is correct |