#include <iostream> //cin, cout
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
#include <bitset>
//usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)
bitset<500> pos[500], cur[500];
int main(){
int n, m, k; cin >> n >> m >> k;
F(i, 5) F(j, m){
char c; cin >> c; if(c == '.') pos[i][j] = 1;
}
string z; cin >> z;
F(i, n) cur[i] = pos[i];
F(q, k){
if(z[q] == 'E') F(i, n) cur[i] = (cur[i] << 1) & pos[i];
else if(z[q] == 'W') F(i, n) cur[i] = (cur[i] >> 1) & pos[i];
else if(z[q] == 'N') F(i, n - 1) {cur[i] = cur[i + 1] & pos[i]; cur[i + 1].reset();}
else if(z[q] == 'S') for(int i = n - 2; i >= 0; i--) {cur[i + 1] = cur[i] & pos[i + 1]; cur[i].reset();}
else {
bitset<500> temp[500];
F(i, n) temp[i] |= (cur[i] << 1) & pos[i];
F(i, n) temp[i] |= (cur[i] >> 1) & pos[i];
F(i, n - 1) temp[i] |= cur[i + 1] & pos[i];
for(int i = n - 2; i >= 0; i--) temp[i + 1] |= cur[i] & pos[i + 1];
F(i, n) cur[i] = temp[i];
}
}
int an = 0;
F(i, n) an += cur[i].count();
cout << an;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
