#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.first >> p.second; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.first << ' ' << p.second; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define END '\n'
#define inf 9e18
#define ff first
#define ss second
#define pb push_back
const int maxN = 500;
void solve(){
int n, m, c;
cin >> n >> m >> c;
vector<bitset<500>> inv(n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
char cc;
cin >> cc;
if (cc == '.') inv[i][j] = 1;
}
}
string s;
cin >> s;
vector<bitset<500>> ans(n), prev = inv, cur(n);
bitset<500> zero;
for (int i = 0; i < c; ++i) {
for (int j = 0; j < n; ++j) {
cur[j] = zero;
if (s[i] == 'N' && j < n - 1) cur[j] = (prev[j + 1] & inv[j]);
else if (s[i] == 'S' && j > 0) cur[j] = (prev[j - 1] & inv[j]);
else if (s[i] == 'E') cur[j] = (prev[j] << 1) & inv[j];
else if (s[i] == 'W') cur[j] = (prev[j] >> 1) & inv[j];
else if (s[i] == '?') cur[j] = (((j > 0) ? prev[j - 1] : zero) | (j < n - 1 ? prev[j + 1] : zero) | (prev[j] >> 1) | (prev[j] << 1)) & inv[j];
}
cur.swap(prev);
}
int tot = 0;
for (int i = 0; i < n; ++i) tot += prev[i].count();
cout << tot << END;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int t = 1;
// cin >> t;
while(t--){
solve();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
328 KB |
Output is correct |
| 16 |
Correct |
2 ms |
332 KB |
Output is correct |
| 17 |
Correct |
2 ms |
332 KB |
Output is correct |
| 18 |
Correct |
2 ms |
332 KB |
Output is correct |
| 19 |
Correct |
2 ms |
332 KB |
Output is correct |
| 20 |
Correct |
3 ms |
332 KB |
Output is correct |
| 21 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
332 KB |
Output is correct |
| 5 |
Correct |
1 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
332 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
332 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
328 KB |
Output is correct |
| 16 |
Correct |
2 ms |
332 KB |
Output is correct |
| 17 |
Correct |
2 ms |
332 KB |
Output is correct |
| 18 |
Correct |
2 ms |
332 KB |
Output is correct |
| 19 |
Correct |
2 ms |
332 KB |
Output is correct |
| 20 |
Correct |
3 ms |
332 KB |
Output is correct |
| 21 |
Correct |
2 ms |
332 KB |
Output is correct |
| 22 |
Correct |
122 ms |
588 KB |
Output is correct |
| 23 |
Correct |
117 ms |
684 KB |
Output is correct |
| 24 |
Correct |
113 ms |
588 KB |
Output is correct |
| 25 |
Correct |
111 ms |
688 KB |
Output is correct |
| 26 |
Correct |
119 ms |
680 KB |
Output is correct |
| 27 |
Correct |
185 ms |
700 KB |
Output is correct |
| 28 |
Correct |
188 ms |
684 KB |
Output is correct |
| 29 |
Correct |
187 ms |
700 KB |
Output is correct |
| 30 |
Correct |
187 ms |
608 KB |
Output is correct |
| 31 |
Correct |
182 ms |
588 KB |
Output is correct |
| 32 |
Correct |
239 ms |
588 KB |
Output is correct |
| 33 |
Correct |
242 ms |
684 KB |
Output is correct |
| 34 |
Correct |
245 ms |
700 KB |
Output is correct |
| 35 |
Correct |
241 ms |
696 KB |
Output is correct |
| 36 |
Correct |
242 ms |
600 KB |
Output is correct |
