답안 #926011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926011 2024-02-12T12:50:49 Z vjudge1 Nautilus (BOI19_nautilus) C++17
100 / 100
96 ms 536 KB
//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 = 5e2 + 7;
const int M = 5e3 + 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

int n, m, k;
bool border(int i, int j) {
    return i >= 1 && i <= n && j >= 1 && j <= m;
}
int id[255];
bitset <N> fn[N], dp[N], dp2[N];
char s[M];
void shiftWE(char type) {
    for (int i = 1;i <= n;i++)dp2[i] = (dp2[i] | ((type == 'W' ? (dp[i] >> 1) : (dp[i] << 1)) & fn[i]));
}
void shiftNS(char type) {
    for (int i = 1;i <= n;i++)dp2[i] = (dp2[i] | ((type == 'N' ? dp[i + 1] : dp[i - 1]) & fn[i]));
}
void solve() {
    cin >> n >> m >> k;
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            char c;
            cin >> c;
            fn[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 i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            if (fn[i][j])dp[i][j] = 1;
        }
    };
    for (int step = 1;step <= k;step++) {
        //cout << step << ":\n";
        if (s[step] == '?')shiftWE('W'), shiftWE('E'), shiftNS('N'), shiftNS('S');
        else {
            char type = s[step];
            if (type == 'E' || type == 'W')shiftWE(type);
            else shiftNS(type);
        }
        for (int i = 1;i <= n;i++)dp[i] = dp2[i], dp2[i].reset();
    }
    for (int i = 1;i <= n;i++)ans += dp[i].count();
    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

nautilus.cpp:4: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    4 | #pragma comment(linker, "/stack:200000000")
      |
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 356 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 50 ms 536 KB Output is correct
23 Correct 53 ms 348 KB Output is correct
24 Correct 53 ms 536 KB Output is correct
25 Correct 50 ms 348 KB Output is correct
26 Correct 48 ms 348 KB Output is correct
27 Correct 75 ms 348 KB Output is correct
28 Correct 76 ms 532 KB Output is correct
29 Correct 77 ms 348 KB Output is correct
30 Correct 77 ms 532 KB Output is correct
31 Correct 76 ms 536 KB Output is correct
32 Correct 92 ms 348 KB Output is correct
33 Correct 95 ms 532 KB Output is correct
34 Correct 95 ms 536 KB Output is correct
35 Correct 96 ms 348 KB Output is correct
36 Correct 93 ms 348 KB Output is correct