oj.uz

답안 #198815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
198815 2020-01-27T18:43:39 Z dolphingarlic 포탈들 (BOI14_portals) C++14
70 / 100
 1000 ms 98068 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4,avx2,fma,avx")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

bool open[1002][1002];
int n, m, visited[1002][1002], to_wall[1002][1002];
pair<int, int> graph[1002][1002][8], src, dest;

inline bool has_wall(int x, int y) {
    return !(open[x - 1][y] && open[x + 1][y] && open[x][y - 1] &&
             open[x][y + 1]);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    FOR(i, 1, n + 1) FOR(j, 1, m + 1) {
        char c;
        cin >> c;
        if (c != '#') open[i][j] = true;
        if (c == 'S') src = {i, j};
        if (c == 'C') dest = {i, j};
    }

    FOR(i, 1, n + 1) FOR(j, 1, m + 1) {
        if (open[i - 1][j]) graph[i][j][0] = {i - 1, j};
        if (open[i + 1][j]) graph[i][j][1] = {i + 1, j};
        if (open[i][j - 1]) graph[i][j][2] = {i, j - 1};
        if (open[i][j + 1]) graph[i][j][3] = {i, j + 1};
    }

    queue<pair<int, int>> q;
    FOR(i, 1, n + 1) FOR(j, 1, m + 1) {
        if (open[i][j] && has_wall(i, j)) {
            to_wall[i][j] = 1;
            q.push({i, j});
        }
    }
    while (q.size()) {
        pair<int, int> curr = q.front();
        int x = curr.first, y = curr.second;
        q.pop();
        FOR(i, 0, 4) {
            if (!to_wall[graph[x][y][i].first][graph[x][y][i].second]) {
                to_wall[graph[x][y][i].first][graph[x][y][i].second] =
                    to_wall[x][y] + 1;
                q.push(graph[x][y][i]);
            }
        }
    }

    pair<int, int> bound;
    bool has = false;
    FOR(i, 0, n + 1) FOR(j, 0, m + 1) {
        if (!open[i][j])
            has = false;
        else {
            if (!has)
                bound = {i, j};
            else if (j - bound.second > 1)
                graph[i][j][4] = bound;
            has = true;
        }
    }
    FOR(j, 0, m + 1) FOR(i, 0, n + 1) {
        if (!open[i][j])
            has = false;
        else {
            if (!has)
                bound = {i, j};
            else if (i - bound.first > 1)
                graph[i][j][5] = bound;
            has = true;
        }
    }
    for (int i = n + 1; i; i--)
        for (int j = m + 1; j; j--) {
            if (!open[i][j])
                has = false;
            else {
                if (!has)
                    bound = {i, j};
                else if (bound.second - j > 1)
                    graph[i][j][6] = bound;
                has = true;
            }
        }
    for (int j = m + 1; j; j--)
        for (int i = n + 1; i; i--) {
            if (!open[i][j])
                has = false;
            else {
                if (!has)
                    bound = {i, j};
                else if (bound.first - i > 1)
                    graph[i][j][7] = bound;
                has = true;
            }
        }

    priority_queue<pair<int, pair<int, int>>> pq;
    pq.push({-1, src});
    while (pq.size()) {
        pair<int, int> curr = pq.top().second;
        int dist = pq.top().first, x = curr.first, y = curr.second;
        pq.pop();
        if (!visited[x][y]) {
            visited[x][y] = -dist;
            FOR(i, 0, 4)
            if (graph[x][y][i].first)
                pq.push({dist - 1, graph[x][y][i]});
            FOR(i, 4, 8)
            if (graph[x][y][i].first)
                pq.push({dist - to_wall[x][y], graph[x][y][i]});
        }
        if (curr == dest) break;
    }
    cout << visited[dest.first][dest.second] - 1;
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 9 ms 1400 KB Output is correct
10 Correct 7 ms 1272 KB Output is correct
11 Correct 7 ms 1148 KB Output is correct
12 Correct 6 ms 1144 KB Output is correct
13 Correct 7 ms 1144 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 7 ms 1144 KB Output is correct
16 Correct 5 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 20 ms 5624 KB Output is correct
6 Correct 24 ms 5624 KB Output is correct
7 Correct 21 ms 5624 KB Output is correct
8 Correct 11 ms 5624 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 508 KB Output is correct
9 Correct 9 ms 1272 KB Output is correct
10 Correct 7 ms 1360 KB Output is correct
11 Correct 7 ms 1144 KB Output is correct
12 Correct 6 ms 1144 KB Output is correct
13 Correct 7 ms 1144 KB Output is correct
14 Correct 20 ms 5624 KB Output is correct
15 Correct 25 ms 5624 KB Output is correct
16 Correct 21 ms 5624 KB Output is correct
17 Correct 28 ms 5624 KB Output is correct
18 Correct 35 ms 5624 KB Output is correct
19 Correct 12 ms 4984 KB Output is correct
20 Correct 30 ms 7028 KB Output is correct
21 Correct 20 ms 5624 KB Output is correct
22 Correct 21 ms 5624 KB Output is correct
23 Correct 24 ms 5624 KB Output is correct
24 Correct 77 ms 6264 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 7 ms 1144 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 12 ms 5624 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 8 ms 1272 KB Output is correct
10 Correct 7 ms 1272 KB Output is correct
11 Correct 6 ms 1144 KB Output is correct
12 Correct 6 ms 1144 KB Output is correct
13 Correct 6 ms 1144 KB Output is correct
14 Correct 19 ms 5624 KB Output is correct
15 Correct 24 ms 5624 KB Output is correct
16 Correct 22 ms 5624 KB Output is correct
17 Correct 27 ms 5624 KB Output is correct
18 Correct 37 ms 5624 KB Output is correct
19 Correct 12 ms 4984 KB Output is correct
20 Correct 30 ms 7028 KB Output is correct
21 Correct 19 ms 5624 KB Output is correct
22 Correct 21 ms 5628 KB Output is correct
23 Correct 24 ms 5624 KB Output is correct
24 Correct 858 ms 72760 KB Output is correct
25 Execution timed out 1090 ms 98068 KB Time limit exceeded
26 Halted 0 ms 0 KB -