oj.uz

답안 #973499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973499 2024-05-02T05:51:39 Z njoop 포탈들 (BOI14_portals) C++17
70 / 100
 1000 ms 45364 KB 
#include <bits/stdc++.h>

using namespace std;

int r, c, dp[1010][1010], stx, sty, enx, eny, cx, cy, cdi, mn;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
char arr[1010][1010];
pair<int, int> dir[4][1010][1010], cur;
queue<tuple<int, int, int>> q;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> r >> c;
    for(int i=0; i<1010; i++) for(int j=0; j<1010; j++) arr[i][j] = '#';
    for(int i=1; i<=r; i++) {
        for(int j=1; j<=c; j++) {
            cin >> arr[i][j];
            if(arr[i][j] == 'S') {
                stx = i;
                sty = j;
            }
            if(arr[i][j] == 'C') {
                enx = i;
                eny = j;
            }
            dp[i][j] = 1e9;
        }
    }
    for(int j=0; j<=c+1; j++) {
        for(int i=0; i<=r+1; i++) {
            if(arr[i][j] == '#') cur = {i+1, j};
            dir[0][i][j] = cur;
        }
    }
    for(int i=0; i<=r+1; i++) {
        for(int j=0; j<=c+1; j++) {
            if(arr[i][j] == '#') cur = {i, j+1};
            dir[1][i][j] = cur;
        }
    }
    for(int j=0; j<=c+1; j++) {
        for(int i=r+1; i>=0; i--) {
            if(arr[i][j] == '#') cur = {i-1, j};
            dir[2][i][j] = cur;
        }
    }
    for(int i=0; i<=r+1; i++) {
        for(int j=c+1; j>=0; j--) {
            if(arr[i][j] == '#') cur = {i, j-1};
            dir[3][i][j] = cur;
        }
    }
    q.push({stx, sty, 0});
    while(q.size()) {
        cx = get<0>(q.front());
        cy = get<1>(q.front());
        cdi = get<2>(q.front());
        q.pop();
        if(cx < 1 || cx > r || cy < 1 || cy > c || dp[cx][cy] <= cdi || arr[cx][cy] == '#') continue;
        dp[cx][cy] = cdi;
        mn = 1e9;
        for(int i=0; i<4; i++) {
            mn = min(mn, abs(dir[i][cx][cy].first-cx) + abs(dir[i][cx][cy].second-cy));
            q.push({cx+dx[i], cy+dy[i], cdi+1});
        }
        for(int i=0; i<4; i++) {
            q.push({dir[i][cx][cy].first, dir[i][cx][cy].second, cdi+mn+1});
        }
    }
    cout << dp[enx][eny];
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8668 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8948 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8536 KB Output is correct
8 Correct 1 ms 8536 KB Output is correct
9 Correct 4 ms 14936 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 1 ms 8660 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8676 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 8 ms 19036 KB Output is correct
6 Correct 6 ms 19032 KB Output is correct
7 Correct 7 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 1 ms 8536 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 2 ms 14812 KB Output is correct
14 Correct 6 ms 19032 KB Output is correct
15 Correct 6 ms 18904 KB Output is correct
16 Correct 7 ms 19032 KB Output is correct
17 Correct 91 ms 19884 KB Output is correct
18 Correct 16 ms 19292 KB Output is correct
19 Correct 25 ms 19548 KB Output is correct
20 Correct 29 ms 19796 KB Output is correct
21 Correct 7 ms 19036 KB Output is correct
22 Correct 8 ms 19036 KB Output is correct
23 Correct 8 ms 19292 KB Output is correct
24 Correct 7 ms 19036 KB Output is correct
25 Correct 1 ms 8536 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 5 ms 18912 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 2 ms 14940 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 3 ms 14924 KB Output is correct
14 Correct 8 ms 19036 KB Output is correct
15 Correct 6 ms 19036 KB Output is correct
16 Correct 6 ms 19036 KB Output is correct
17 Correct 91 ms 20052 KB Output is correct
18 Correct 16 ms 19288 KB Output is correct
19 Correct 26 ms 19540 KB Output is correct
20 Correct 30 ms 19544 KB Output is correct
21 Correct 7 ms 18908 KB Output is correct
22 Correct 7 ms 19036 KB Output is correct
23 Correct 8 ms 19036 KB Output is correct
24 Execution timed out 1036 ms 45364 KB Time limit exceeded
25 Halted 0 ms 0 KB -