oj.uz

답안 #869527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
869527 2023-11-04T15:56:14 Z wakandaaa Nautilus (BOI19_nautilus) C++17
100 / 100
 194 ms 159572 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int m, n, k;
string s;
bitset<505> a[505], f[5005][505];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> m >> n >> k;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            char c;
            cin >> c;
            if (c == '.') {
                a[i][j] = 1;
                f[0][i][j] = 1;
            }
        }
    }

    cin >> s;
    s = " " + s;
    for (int i = 1; i <= k; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i] == 'N') f[i][j] = f[i - 1][j + 1] & a[j];
            else if (s[i] == 'S') f[i][j] = f[i - 1][j - 1] & a[j];
            else if (s[i] == 'W') f[i][j] = (f[i - 1][j] >> 1) & a[j];
            else if (s[i] == 'E') f[i][j] = (f[i - 1][j] << 1) & a[j];
            else f[i][j] = (f[i - 1][j + 1] | f[i - 1][j - 1] | (f[i - 1][j] >> 1) | (f[i - 1][j] << 1)) & a[j];
        }
    }

    int ans = 0;
    for (int i = 0; i < m; ++i) {
        ans += f[k][i].count();
    }

    cout << ans;

    return 0;
}

/*

*/

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4648 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4440 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4648 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4440 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 99 ms 158720 KB Output is correct
23 Correct 96 ms 158884 KB Output is correct
24 Correct 91 ms 158764 KB Output is correct
25 Correct 94 ms 158804 KB Output is correct
26 Correct 87 ms 158656 KB Output is correct
27 Correct 144 ms 158916 KB Output is correct
28 Correct 147 ms 158756 KB Output is correct
29 Correct 147 ms 158920 KB Output is correct
30 Correct 147 ms 158888 KB Output is correct
31 Correct 144 ms 158872 KB Output is correct
32 Correct 191 ms 158792 KB Output is correct
33 Correct 194 ms 158808 KB Output is correct
34 Correct 188 ms 158912 KB Output is correct
35 Correct 189 ms 159572 KB Output is correct
36 Correct 189 ms 158800 KB Output is correct