제출 #1187813

#제출 시각아이디문제언어결과실행 시간메모리
1187813arazoglunNautilus (BOI19_nautilus)C++20
100 / 100
981 ms1056 KiB
#pragma GCC optimize("Ofast")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define l1 long long
#define pi1 pair<int, int>
using namespace std;

const int N = 501;

int n, m, x;
char z[N*N*3];
char g[N][N];
bitset<N*N> dp, water;

#define pos(i, j) (i*N+j)

int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin >> n >> m >> x;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> g[i][j];
            if (g[i][j] == '.')
                water[pos(i, j)] = 1;
        }
    }
    for (int i = 0; i < x; cin >> z[i++]);
    dp = water;
    for (const char &c : z) {
        if (c == '?') dp = (dp<<1) | (dp>>1) | (dp<<N) | (dp>>N);
        else if (c == 'E') dp = (dp<<1);
        else if (c == 'W') dp = (dp>>1);
        else if (c == 'S') dp = (dp<<N);
        else if (c == 'N') dp = (dp>>N);
        dp &= water;
    }
    cout << dp.count();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...