# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
540870 | Olympia | Nautilus (BOI19_nautilus) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <string>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <type_traits>
#include <string>
#include <queue>
#define ll long long
#include <map>
using namespace std;
vector<string> vec;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int R, C, M;
cin >> R >> C >> M;
vec.resize(R);
for (int i = 0; i < R; i++) {
cin >> vec[i];
assert(vec[i].size() == C);
}
string s;
cin >> s;
bitset<10000> orig;
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
//cout << C * i + j << '\n';
if (vec[i][j] == '.') {
orig.set(C * i + j + 500);
}
}
}
bitset<10000> pos = orig;
map<char,pair<int,int>> myMap;
myMap['W'] = {0, -1};
myMap['E'] = {0, 1};
myMap['S'] = {1, 0};
myMap['N'] = {-1, 0};
//cout << pos.count() << '\n';
for (int i = 0; i < s.length(); i++) {
bitset<10000> valid;
for (char c: {'W', 'N', 'S', 'E'}) {
if (s[i] == c || s[i] == '?') {
bitset<10000> dum = pos;
if (myMap[c].second != 0) {
if (myMap[c].second > 0) dum >>= 1;
else dum <<= 1;
} else {
if (myMap[c].first > 0) dum <<= C;
else dum >>= C;
}
valid = valid | (dum & orig);
}
}
pos = valid;
//cout << pos.count() << '\n';
}
cout << pos.count() << '\n';
}