제출 #661317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
661317		jiahng	Nautilus (BOI19_nautilus)	C++14	100 / 100	191 ms	972 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define ll int
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 505
#define maxt 5005
#define INF (ll)1e18
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int R,C,M;
bool A[maxn][maxn];
char S[maxt], ch;
bitset <maxn> dp[maxn][2];
bitset <maxn> freebs[maxn];
int32_t main(){
    cin >> R >> C >> M;
    FOR(i,1,R){
        FOR(j,1,C){
            cin >> ch; A[i][j] = (ch == '.');
            freebs[i][j] = A[i][j];
        }
    }
    FOR(i,1,M) cin >> S[i];

    FOR(i,1,R){
        FOR(j,1,C) dp[i][0][j] = A[i][j]; 
    }
    FOR(t,1,M){
        FOR(i,1,R){ 
            if (S[t] == 'E'){
                // dp[i][j][1] = (dp[i][j-1][0] & A[i][j]);
                dp[i][1] = ((dp[i][0] << 1) & freebs[i]);
            }else if (S[t] == 'W'){
                //dp[i][j][1] = (dp[i][j+1][0] & A[i][j]);
                dp[i][1] = ((dp[i][0] >> 1) & freebs[i]);
            }else if (S[t] == 'S'){
                //dp[i][j][1] = (dp[i-1][j][0] & A[i][j]);
                dp[i][1] = (dp[i-1][0] & freebs[i]);
            }else if (S[t] == 'N'){
                //dp[i][j][1] = (dp[i+1][j][0] & A[i][j]);
                dp[i][1] = (dp[i+1][0] & freebs[i]);
            }else{
                //dp[i][j][1] = ((dp[i-1][j][0] | dp[i+1][j][0] | dp[i][j-1][0] | dp[i][j+1][0]) & A[i][j]);
                dp[i][1] = (((dp[i][0] >> 1) | (dp[i][0] << 1) | dp[i+1][0] | dp[i-1][0]) & freebs[i]);
            }
        }
        FOR(i,1,R) dp[i][0] = dp[i][1];
    }
    int ans = 0;
    FOR(i,1,R) ans += dp[i][0].count();
    cout << ans;
}

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