Submission #1099165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099165		anhthi	Nautilus (BOI19_nautilus)	C++14	100 / 100	199 ms	196520 KiB

nautilus

#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define heap priority_queue
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }

template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }

template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }

int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcount(ll x) { return __builtin_popcount(x); }

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}

const ll oo = (ll) 1e17;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;

const int N = 555, M = 5555;

void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n, m, len;

string s;
char a[N][N];

bitset<N> f[M][N], ok[N];

signed main(void) {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> m >> len;
    rep(i, n) rep(j, m) cin >> a[i][j];

    cin >> s;
    s = '!' + s;

    rep(i, n) rep(j, m) f[0][i][j] = ok[i][j] = (a[i][j] == '.');
    rep(t, len) {
        #define ok(c) ((s[t] == '?') || (s[t] == (c)))
        forn(i, 1, n) {
            if (ok('N')) f[t][i] |= f[t-1][i+1]; 
            if (ok('S')) f[t][i] |= f[t-1][i-1];
            if (ok('W')) f[t][i] |= f[t-1][i] >> 1;
            if (ok('E')) f[t][i] |= f[t-1][i] << 1;
            f[t][i] &= ok[i];
        }
    }

    int cnt = 0;
    rep(i, n) cnt += f[len][i].count();

    cout << cnt;     

    return 0;   
}

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