Submission #925626

#	Time	Username	Problem	Language	Result	Execution time	Memory
925626		Pragmatism	Nautilus (BOI19_nautilus)	C++17	66 / 100	20 ms	9404 KiB

nautilus

//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 1e2 + 7;
const int M = 1e3 + 7;
const int maxA = 2e6 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define int long long

bool a[N][N];
int n, m, k, dp[N][N][N];
bool border(int i, int j) {
    return i >= 1 && i <= n && j >= 1 && j <= m;
}
int id[255];
char s[N];
void solve() {
    cin >> n >> m >> k;
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            char c;
            cin >> c;
            a[i][j] = (c == '.' ? 1 : 0);
        }
    }
    for (int i = 1;i <= k;i++)cin >> s[i];
    id['W'] = 0, id['N'] = 1, id['E'] = 2, id['S'] = 3;
    int ans = 0;
    for (int step = 0;step <= k;step++) {
        //cout << step << ":\n";
        for (int i = 1;i <= n;i++) {
            for (int j = 1;j <= m;j++) {
                if (!a[i][j]) {
                    //cout << 0 << ' ';
                    skip;
                }
                if (step == 0) {
                    dp[i][j][0] = 1;
                    //cout << 1 << ' ';
                    skip;
                }
                if (s[step] == '?') {
                    for (auto p : dir) {
                        int x = i + p.x, y = j + p.y;
                        if (border(x, y) && a[x][y])dp[i][j][step] |= dp[x][y][step - 1];
                    }
                }
                else {
                    int x = i + dir[id[s[step]]].x, y = j + dir[id[s[step]]].y;
                    if (border(x, y) && a[x][y])dp[i][j][step] |= dp[x][y][step - 1];
                }
                if (step == k)ans += dp[i][j][step];
                //cout << dp[i][j][step] << ' ';
            }
            //cout << '\n';
        }
    }
    cout << ans;
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    //freopen("tests.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Compilation message (stderr)

nautilus.cpp: In function 'void solve()':
nautilus.cpp:76:46: warning: array subscript has type 'char' [-Wchar-subscripts]
   76 |                     int x = i + dir[id[s[step]]].x, y = j + dir[id[s[step]]].y;
      |                                        ~~~~~~^
nautilus.cpp:76:74: warning: array subscript has type 'char' [-Wchar-subscripts]
   76 |                     int x = i + dir[id[s[step]]].x, y = j + dir[id[s[step]]].y;
      |                                                                    ~~~~~~^

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