제출 #1206996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1206996		dksnfjkfnwkfw	Nautilus (BOI19_nautilus)	C++20	100 / 100	169 ms	158028 KiB

nautilus

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

#define sonic ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define IO(main) if(fopen(main".inp","r")){freopen(main".inp","r",stdin);freopen(main".out","w",stdout);}
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define ins insert
#define pb push_back
#define el cout << endl
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define MASK(i) ((1LL)<<(i))
#define BIT(x,i) (((x)>>(i))&(1LL))
#define FOR(i, a, b) for(int (i)=(a);(i)<=(b); i++)
#define FORD(i, a, b) for(int (i)=(a);(i)>=(b); i--)


using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;

const int N = 504;
const int mod = 1e9 + 7;
const ll INF = 1e18 + 7;
const int base = 31;
const int LOG = 20;
const ll MOD = 1e9 + 7;

int mul(int x, int y) {return 1LL * x * y % mod;}
int calPw(int x, int y)
{
    int ans = 1;
    while(y)
    {
        if (y&1) ans = 1LL * ans * x % mod;
        x = 1LL * x * x % mod;
        y >>= 1;
    }
    return ans;
}
int d4x[4] = {1, 0, -1, 0};
int d4y[4] = {0, 1, 0, -1};
int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
///Author: Le Chi Thien Luong The Vinh high school 2008
///code
template<class X, class Y>
bool minimize(X &x , Y y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool maximize(X &x , Y y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class X, class Y>
bool add(X &x , Y y){
    if((x + y ) >= mod){
        ll tmp  = x + y;
        x = tmp - mod;
        return true;
    }
    return false;
}
void Solve(){

}
int n, m, q;
string s;
bitset<N>dp[5005][503];
bitset<N>a[5005];
void Read(){
    cin >> n >> m >> q;
    FOR(i, 1, n){
        FOR(j, 1, m){
            char c;
            cin >> c;
            if(c == '#')a[i][j] = 0;
            else a[i][j] = 1;
            dp[0][i][j] = a[i][j];
        }
    }
    cin >> s;
    s = ' ' + s;
    FOR(i, 1, q){
        if(s[i] == 'N' || s[i] == '?')FOR(j, 1, n)dp[i][j] |= dp[i - 1][j + 1];
        if(s[i] == 'S' || s[i] == '?')FOR(j, 1, n)dp[i][j] |= dp[i - 1][j - 1];
        if(s[i] == 'E' || s[i] == '?')FOR(j, 1, n)dp[i][j] |= (dp[i - 1][j] << 1);
        if(s[i] == 'W' || s[i] == '?')FOR(j, 1, n)dp[i][j] |= (dp[i - 1][j] >> 1);
        FOR(j, 1, n)dp[i][j] &= (a[j]);
    }
    int ans = 0;
    FOR(i, 1, n){
        FOR(j, 1, m){
            ans += (dp[q][i][j] == 1) ;
        }
    }
    cout << ans;
}



int main()
{
    sonic;

    int TEST = 1;
   // cin >> TEST;
    while(TEST--)
    {

        Read();
        Solve();
    }
}

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