# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655867 | 600Mihnea | Nautilus (BOI19_nautilus) | C++17 | 0 ms | 212 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.
bool home = 1;
bool verbose;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 500 + 7;
int n;
int m;
int sdim;
bool valid_place[N][N];
bool ok[N][N];
bool nok[N][N];
string s;
void print() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cout << ok[i][j];
}
cout << "\n";
}
cout << "##########################################\n";
}
int main() {
if (home) {
verbose = 1;
freopen ("___input___.txt", "r", stdin);
} else {
verbose = 0;
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
}
cin >> n >> m >> sdim;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
for (int j = 1; j <= m; j++) {
char ch = s[j - 1];
assert(ch == '.' || ch == '#');
valid_place[i][j] = (ch == '.');
}
}
cin >> s;
assert((int) s.size() == sdim);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ok[i][j] = valid_place[i][j];
}
}
for (int itp = 0; itp < sdim; itp++) {
char ch = s[itp];
assert(ch == 'N' || ch == 'E' || ch == 'S' || ch == 'W' || ch == '?');
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
nok[i][j] = 0;
}
}
if (ch == 'N' || ch == '?') {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
nok[i][j] |= ok[i + 1][j];
}
}
}
if (ch == 'S' || ch == '?') {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
nok[i][j] |= ok[i - 1][j];
}
}
}
if (ch == 'E' || ch == '?') {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
nok[i][j] |= ok[i][j - 1];
}
}
}
if (ch == 'W' || ch == '?') {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
nok[i][j] |= ok[i][j + 1];
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ok[i][j] = nok[i][j] & valid_place[i][j];
}
}
int sol = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sol += ok[i][j];
}
}
}
int sol = 0, sol2 = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sol += ok[i][j];
// cout << (is_ok(i, j, 0) ^ ok[i][j]) << " ";
}
// cout << "\n";
}
cout << sol << "\n";
return 0;
}
/**
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |