oj.uz

답안 #593602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593602 2022-07-11T12:27:09 Z nguyentu Nautilus (BOI19_nautilus) C++14
66 / 100
 16 ms 9096 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 = 1e2 + 7;
const int MOD = 1e9 + 7;

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

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    int n , m , l; cin >> n >> m >> l;
    for (int i = 1 ; i <= n ; i++) {
        for (int j = 1 ; j <= m ; j++) {
            cin >> a[i][j];
        }
    }   
    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 i = 1 ; i <= l ; i++) {
        cin >> s[i];
    }
    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;
    int cnt = 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;
    return 0;
}

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:67:9: warning: unused variable 'cnt' [-Wunused-variable]
   67 |     int cnt = 0;
      |         ^~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9096 KB Output is correct
2 Correct 10 ms 9044 KB Output is correct
3 Correct 10 ms 8948 KB Output is correct
4 Correct 9 ms 8532 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 2 ms 468 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9096 KB Output is correct
2 Correct 10 ms 9044 KB Output is correct
3 Correct 10 ms 8948 KB Output is correct
4 Correct 9 ms 8532 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 8 ms 9044 KB Output is correct
8 Correct 10 ms 8916 KB Output is correct
9 Correct 9 ms 8404 KB Output is correct
10 Correct 9 ms 6356 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 10 ms 9044 KB Output is correct
13 Correct 12 ms 9036 KB Output is correct
14 Correct 15 ms 8916 KB Output is correct
15 Correct 7 ms 6356 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 9 ms 9044 KB Output is correct
18 Correct 14 ms 9072 KB Output is correct
19 Correct 16 ms 8300 KB Output is correct
20 Correct 10 ms 6100 KB Output is correct
21 Correct 3 ms 340 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9096 KB Output is correct
2 Correct 10 ms 9044 KB Output is correct
3 Correct 10 ms 8948 KB Output is correct
4 Correct 9 ms 8532 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 8 ms 9044 KB Output is correct
8 Correct 10 ms 8916 KB Output is correct
9 Correct 9 ms 8404 KB Output is correct
10 Correct 9 ms 6356 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 10 ms 9044 KB Output is correct
13 Correct 12 ms 9036 KB Output is correct
14 Correct 15 ms 8916 KB Output is correct
15 Correct 7 ms 6356 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 9 ms 9044 KB Output is correct
18 Correct 14 ms 9072 KB Output is correct
19 Correct 16 ms 8300 KB Output is correct
20 Correct 10 ms 6100 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Runtime error 2 ms 724 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -