oj.uz

답안 #593714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593714 2022-07-11T13:58:02 Z nguyentu Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 10096 KB 
#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

#define ii pair<int , int>  
#define iv pair<ii , ii>
#define iii pair<int , ii>
#define fi first
#define se second
#define int long long
const int inf = 1e18 + 7;
const int MAX_N = 5e2 + 7;
const int MOD = 1e9 + 7;

char a[MAX_N][MAX_N];
int f[MAX_N][MAX_N][107];
char s[5007];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    int n , m , l; cin >> n >> m >> l;
    //subtask 1&2
    if (n <= 100 && m <= 100 && l <= 100) {
        for (int i = 1 ; i <= n ; i++) {
            for (int j = 1 ; j <= m ; j++) {
                cin >> a[i][j];
            }
        }   
        
        for (int i = 1 ; i <= l ; i++) {
            cin >> s[i];
        }
        for (int i = 1 ; i <= n ; i++) {
            for (int j = 1 ; j <= m ; j++) {
                if (a[i][j] != '#') {
                    f[i][j][0] = 1;
                } 
            }
        }
        for (int h = 1 ; h <= l ; h++) {
            for (int i = 1 ; i <= n ;i ++) {
                for (int j = 1 ; j <= m ; j++) {
                    if (a[i][j] == '#') continue;;
                    if (s[h] == 'W' && j < m) {
                        f[i][j][h] = f[i][j + 1][h - 1];
                    }
                    if (s[h] == 'N' && i < n) {
                        f[i][j][h] = f[i + 1][j][h - 1]; 
                    }
                    if (s[h] == 'E' && 1 < j) {
                        f[i][j][h] = f[i][j - 1][h - 1];
                    }
                    if (s[h] == 'S' && 1 < i) {
                        f[i][j][h] = f[i - 1][j][h - 1];
                    }
                    if (s[h] == '?') {
                        if (j < m && f[i][j + 1][h - 1]) f[i][j][h] = f[i][j + 1][h - 1];
                        if (i < n && f[i + 1][j][h - 1]) f[i][j][h] = f[i + 1][j][h - 1];
                        if (1 < j && f[i][j - 1][h - 1]) f[i][j][h] = f[i][j - 1][h - 1];
                        if (1 < i && f[i - 1][j][h - 1]) f[i][j][h] = f[i - 1][j][h - 1];
                    }
                }
            }
        }
        int ans = 0;

        for (int i = 1 ; i <= n ;i ++) {
            for (int j = 1 ; j <= m ; j++) {
            if (f[i][j][l]) {
                    ans++;
                }
                //cout << f[i][j][l] << " ";
            }
            //cout << '\n';
        }
        cout << ans;
    }
    else {
    //subtask 3
        bitset<5007> f[2][MAX_N];
        bitset<5007> d[MAX_N];
        for (int i = 0 ; i < n ; i++) {
            d[i].flip();
            f[1][i].flip();
            for (int j = 0 ; j < m ; j++) {
                cin >> a[i][j];
                if (a[i][j] == '#') {
                    d[i][j].flip();
                    f[1][i][j].flip();
                }
            }
        }
        for (int i = 0 ; i < l ; i++) {
            cin >> s[i];
        }
        for (int i = 0 ; i < l ; i++) {
            int now = i & 1;
            int prev = now ^ 1;
            for (int j = 0 ; j < n ; j++) {
                if (s[i] == 'W') {
                    f[now][j] = f[prev][j] << 1;
                }
                if (s[i] == 'E') {
                    f[now][j] = f[prev][j] >> 1;
                }
                if (s[i] == 'S') {
                    f[now][j] = f[prev][j - 1];
                }
                if (s[i] == 'N') {
                    f[now][j] = f[prev][j + 1];
                }
                if (s[i] == '?') {
                    f[now][j] |= f[prev][j - 1];
                    f[now][j] |= f[prev][j + 1];
                    f[now][j] |= (f[prev][j] >> 1);
                    f[now][j] |= (f[prev][j] << 1);
                }
                f[now][j] = f[now][j] & d[j];
            }
            for (int j = 0 ; j < n ; j++) {
                f[prev][j] = f[now][j];
            }
        }
        int ans = 0;
        for (int i = 0 ; i < n ; i++) {
            for (int j = 0 ; j < m ; j++) {
                if (f[(l - 1) & 1][i][j]) {
                    ans++;
                }
            }
        }
        cout << ans;
    }
    return 0;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10068 KB Output is correct
2 Correct 9 ms 10068 KB Output is correct
3 Correct 9 ms 9940 KB Output is correct
4 Correct 9 ms 9428 KB Output is correct
5 Correct 8 ms 7636 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10068 KB Output is correct
2 Correct 9 ms 10068 KB Output is correct
3 Correct 9 ms 9940 KB Output is correct
4 Correct 9 ms 9428 KB Output is correct
5 Correct 8 ms 7636 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 10 ms 10068 KB Output is correct
8 Correct 12 ms 9904 KB Output is correct
9 Correct 10 ms 9432 KB Output is correct
10 Correct 7 ms 7636 KB Output is correct
11 Correct 3 ms 1364 KB Output is correct
12 Correct 10 ms 10068 KB Output is correct
13 Correct 14 ms 10096 KB Output is correct
14 Correct 15 ms 9988 KB Output is correct
15 Correct 8 ms 7536 KB Output is correct
16 Correct 3 ms 1364 KB Output is correct
17 Correct 9 ms 10096 KB Output is correct
18 Correct 13 ms 10068 KB Output is correct
19 Correct 14 ms 9428 KB Output is correct
20 Correct 8 ms 7316 KB Output is correct
21 Correct 4 ms 1364 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10068 KB Output is correct
2 Correct 9 ms 10068 KB Output is correct
3 Correct 9 ms 9940 KB Output is correct
4 Correct 9 ms 9428 KB Output is correct
5 Correct 8 ms 7636 KB Output is correct
6 Correct 3 ms 1492 KB Output is correct
7 Correct 10 ms 10068 KB Output is correct
8 Correct 12 ms 9904 KB Output is correct
9 Correct 10 ms 9432 KB Output is correct
10 Correct 7 ms 7636 KB Output is correct
11 Correct 3 ms 1364 KB Output is correct
12 Correct 10 ms 10068 KB Output is correct
13 Correct 14 ms 10096 KB Output is correct
14 Correct 15 ms 9988 KB Output is correct
15 Correct 8 ms 7536 KB Output is correct
16 Correct 3 ms 1364 KB Output is correct
17 Correct 9 ms 10096 KB Output is correct
18 Correct 13 ms 10068 KB Output is correct
19 Correct 14 ms 9428 KB Output is correct
20 Correct 8 ms 7316 KB Output is correct
21 Correct 4 ms 1364 KB Output is correct
22 Execution timed out 1088 ms 1492 KB Time limit exceeded
23 Halted 0 ms 0 KB -