Submission #1176296

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176296		Zbyszek99	Nautilus (BOI19_nautilus)	C++20	100 / 100	151 ms	772 KiB

nautilus

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

bitset<502*502> dp[2];
bitset<502*502> def;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,m,q;
    cin >> n >> m >> q;
    rep(i,n)
    {
        rep(j,m)
        {
            char z;
            cin >> z;
            if(z == '.') def[i*(m+2)+j] = 1;
        }
    }
    dp[0] = def;
    rep(i,q)
    {
        char z;
        cin >> z;
        switch(z)
        {
            case 'N':
            {
                dp[1] = (dp[0] >> (m+2)) & def;
                break;
            }
            case 'S':
            {
                dp[1] = (dp[0] << (m+2)) & def;
                break;
            }
            case 'E':
            {
                dp[1] = (dp[0] << 1) & def;
                break;
            }
            case 'W':
            {
                dp[1] = (dp[0] >> 1) & def;
                break;
            }
            default:
            {
                dp[1] = ((dp[0] >> (m+2)) | (dp[0] << (m+2)) | (dp[0] >> 1) | (dp[0] << 1)) & def;
                break;
            }
        }
        swap(dp[0],dp[1]);
    }
    cout << dp[0].count();
}

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