oj.uz

답안 #1091590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091590 2024-09-21T13:03:23 Z gyg Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 3540 KB 
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define arr array
#define vct vector
const int MX_R = 5e2 + 5, MX_C = 5e2 + 5, MX_N = 5e3 + 5;

int r, c, n;
bool wll[MX_R][MX_C];
arr<char, MX_N> mv;

bool ps[2][MX_R][MX_C];
vct<pii> nt_wll;
void cmp() {
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++)
            if (!wll[i][j]) nt_wll.push_back({i, j});
    for (pii& x : nt_wll) ps[0][x.first][x.second] = true;
    
    for (int i = 1; i <= n; i++) {
        int prty = i % 2, opp_prty = (i + 1) % 2;
        if (mv[i] == 'W') {
            for (pii& x : nt_wll) 
                ps[prty][x.first][x.second] = ps[opp_prty][x.first][x.second + 1]; 
        }
        if (mv[i] == 'E') {
            for (pii& x : nt_wll) 
                ps[prty][x.first][x.second] = ps[opp_prty][x.first][x.second - 1]; 
        }
        if (mv[i] == 'S') {
            for (pii& x : nt_wll) 
                ps[prty][x.first][x.second] = ps[opp_prty][x.first - 1][x.second]; 
        }
        if (mv[i] == 'N') {
            for (pii& x : nt_wll) 
                ps[prty][x.first][x.second] = ps[opp_prty][x.first + 1][x.second]; 
        }
        if (mv[i] == '?') {
            for (pii& x : nt_wll) 
                ps[prty][x.first][x.second] = ps[opp_prty][x.first][x.second + 1] || ps[opp_prty][x.first][x.second - 1]
                                              || ps[opp_prty][x.first - 1][x.second] || ps[opp_prty][x.first + 1][x.second]; 
        }

        // cout << mv[i] << ": " << "----------------" << endl;
        // for (int j = 1; j <= r; j++) {
        //     for (int k = 1; k <= c; k++) cout << ps[prty][j][k];
        //     cout << endl;
        // }
    }
}

int main() {
    // freopen("nt.in", "r", stdin);
    cin.sync_with_stdio(false), cin.tie(0);
    cin >> r >> c >> n;
    for (int i = 1; i <= r; i++) {
        for (int j = 1; j <= c; j++) {
            char x; cin >> x;
            wll[i][j] = (x == '#');
        }
    }
    for (int i = 1; i <= n; i++) cin >> mv[i];

    cmp();
    int ans = 0;
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++) ans += ps[n % 2][i][j];
    cout << ans << endl;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 728 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 728 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 532 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 2 ms 764 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 728 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 848 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 532 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 2 ms 764 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Execution timed out 1056 ms 3540 KB Time limit exceeded
23 Halted 0 ms 0 KB -