제출 #549239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549239		spike1236	Nautilus (BOI19_nautilus)	C++14	100 / 100	163 ms	680 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

bitset <512> dp[512], a[512];
int n, m, k;
bitset <512> cur[512];

void solve() {
    cin >> n >> m >> k;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) {
            char x;
            cin >> x;
            a[i][j] = (x == '.');
        }
    }
    string args;
    cin >> args;
    for(int i = 1; i <= n; ++i) dp[i] = a[i];
    for(auto d : args) {
        for(int i = 1; i <= n; ++i) cur[i].reset();
        if(d == '?' || d == 'N') for(int i = 1; i < n; ++i) cur[i] |= (dp[i + 1]);
        if(d == '?' || d == 'S') for(int i = 2; i <= n; ++i) cur[i] |= (dp[i - 1]);
        if(d == '?' || d == 'E') for(int i = 1; i <= n; ++i) cur[i] |= (dp[i] << 1);
        if(d == '?' || d == 'W') for(int i = 1; i <= n; ++i) cur[i] |= (dp[i] >> 1);
        for(int i = 1; i <= n; ++i) dp[i] = cur[i] & a[i];
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i) ans += dp[i].count();
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

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