// #define _GLIBCXX_DEBUG
// #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;
#define pb push_back
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const int INF = 1e9;
// const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;
string w;
vector<string> mat;
int r, c, m;
bool check(int row, int col){
if(row < 0 || row >= r || col < 0 || col >= c) return false;
if(mat[row][col] == 'X') return false;
return true;
}
bool check(int row, int col, int m){
for(int i = m - 1; i >= 0; --i){
if(w[i] == 'W'){
if(!check(row, col + 1)) return false;
col += 1;
}
if(w[i] == 'N'){
if(!check(row + 1, col)) return false;
row += 1;
}
if(w[i] == 'S'){
if(!check(row - 1, col)) return false;
row -= 1;
}
if(w[i] == 'E'){
if(!check(row, col - 1)) return false;
col -= 1;
}
}
return true;
}
void solve(int tc){
cin >> r >> c >> m;
mat.resize(r);
for(int i = 0; i < r; i++)
cin >> mat[i];
cin >> w;
int ans = 0;
for(int i = 0; i < r; i++){
for(int j = 0; j < c; j++)
if(mat[i][j] == '.')
ans += check(i, j, m);
}
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
#ifdef LOCAL
auto begin = high_resolution_clock::now();
#endif
int tc = 1;
// cin >> tc;
for (int t = 0; t < tc; t++) solve(t);
#ifdef LOCAL
auto end = high_resolution_clock::now();
cout << fixed << setprecision(4) << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
#endif
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
4 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
