Submission #1325896

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325896		sh_qaxxorov_571	Nautilus (BOI19_nautilus)	C++20	100 / 100	108 ms	544 KiB

nautilus

#include <iostream>
#include <vector>
#include <string>
#include <bitset>
using namespace std;
const int MAXC = 505;
bitset<MAXC> can_be[505], next_can_be[505], land[505];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int R, C, M;
    cin >> R >> C >> M;

    for (int i = 0; i < R; ++i) {
        string row;
        cin >> row;
        for (int j = 0; j < C; ++j) {
            if (row[j] == '.') {
                can_be[i][j] = 1;
                land[i][j] = 1;  
            } else {
                land[i][j] = 0;  
            }
        }
    }

    string signals;
    cin >> signals;

    for (char s : signals) {
        for (int i = 0; i < R; ++i) next_can_be[i].reset();

        if (s == 'N' || s == '?') {
            for (int i = 0; i < R - 1; ++i)
                next_can_be[i] |= (can_be[i + 1]);
        }
        if (s == 'S' || s == '?') {
            for (int i = 1; i < R; ++i)
                next_can_be[i] |= (can_be[i - 1]);
        }
        if (s == 'E' || s == '?') {
            for (int i = 0; i < R; ++i)
                next_can_be[i] |= (can_be[i] << 1);
        }
        if (s == 'W' || s == '?') {
            for (int i = 0; i < R; ++i)
                next_can_be[i] |= (can_be[i] >> 1);
        }
        for (int i = 0; i < R; ++i) {
            can_be[i] = next_can_be[i] & land[i];
        }
    }

    int result = 0;
    for (int i = 0; i < R; ++i) {
        for(int j = 0; j < C; j++) {
            if(can_be[i][j]) result++;
        }
    }

    cout << result << endl;

    return 0;
}

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 34 / 34