Submission #869527

#	Time	Username	Problem	Language	Result	Execution time	Memory
869527		wakandaaa	Nautilus (BOI19_nautilus)	C++17	100 / 100	194 ms	159572 KiB

nautilus

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int m, n, k;
string s;
bitset<505> a[505], f[5005][505];

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

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> m >> n >> k;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            char c;
            cin >> c;
            if (c == '.') {
                a[i][j] = 1;
                f[0][i][j] = 1;
            }
        }
    }

    cin >> s;
    s = " " + s;
    for (int i = 1; i <= k; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i] == 'N') f[i][j] = f[i - 1][j + 1] & a[j];
            else if (s[i] == 'S') f[i][j] = f[i - 1][j - 1] & a[j];
            else if (s[i] == 'W') f[i][j] = (f[i - 1][j] >> 1) & a[j];
            else if (s[i] == 'E') f[i][j] = (f[i - 1][j] << 1) & a[j];
            else f[i][j] = (f[i - 1][j + 1] | f[i - 1][j - 1] | (f[i - 1][j] >> 1) | (f[i - 1][j] << 1)) & a[j];
        }
    }

    int ans = 0;
    for (int i = 0; i < m; ++i) {
        ans += f[k][i].count();
    }

    cout << ans;

    return 0;
}

/*

*/

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