oj.uz

답안 #357579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
357579 2021-01-24T07:31:31 Z parsabahrami 포탈들 (BOI14_portals) C++17
100 / 100
 860 ms 135660 KB 
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 1e3 + 10, MOD = 1e9 + 7;
int R[N][N], L[N][N], U[N][N], D[N][N], A[N][N], pd[N * N], dp[N * N], M[N * N], dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0}, n, m, st, en;
vector<pii> adj[N * N]; char S[N]; queue<int> Q;

int id(int x, int y) {
    return x * (m + 1) + y;
}

inline void add_edge(int u, int v, int w) {
    adj[u].push_back({v, w});
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%s", S + 1);
        for (int j = 1; j <= m; j++) {
            if (S[j] == '#') A[i][j] = 0;
            else if (S[j] == 'S') A[i][j] = 1, st = id(i, j);
            else if (S[j] == 'C') A[i][j] = 1, en = id(i, j);
            else A[i][j] = 1;
        }
    }
    fill(dp, dp + N * N, MOD);
    fill(pd, pd + N * N, MOD);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (!A[i][j]) continue;
            for (int d = 0; d < 4; d++) {
                int nx = i + dx[d], ny = j + dy[d];
                if (nx <= 0 || nx > n || ny <= 0 || ny > m || !A[nx][ny]) continue;
                add_edge(id(i, j), id(nx, ny), 1);
            }
            if (SZ(adj[id(i, j)]) != 4) dp[id(i, j)] = 1, Q.push(id(i, j));
        }
    }  
    while (SZ(Q)) {
        int v = Q.front(); Q.pop();
        for (pii u : adj[v]) {
            if (dp[u.F] > dp[v] + u.S) {
                dp[u.F] = dp[v] + u.S;
                Q.push(u.F);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (!A[i][j - 1]) L[i][j] = j;
            else L[i][j] = L[i][j - 1];
        }
        for (int j = m; j >= 1; j--) {
            if (!A[i][j + 1]) R[i][j] = j;
            else R[i][j] = R[i][j + 1];
        }
    }
    for (int j = 1; j <= m; j++) {
        for (int i = 1; i <= n; i++) {
            if (!A[i - 1][j]) U[i][j] = i;
            else U[i][j] = U[i - 1][j];
        }
        for (int i = n; i; i--) {
            if (!A[i + 1][j]) D[i][j] = i;
            else D[i][j] = D[i + 1][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (!A[i][j]) continue;
            int v = id(i, j), l = id(i, L[i][j]), r = id(i, R[i][j]), u = id(U[i][j], j), d = id(D[i][j], j);
            add_edge(v, u, dp[v]);
            add_edge(v, l, dp[v]);
            add_edge(v, d, dp[v]);
            add_edge(v, r, dp[v]);
        }
    }
    priority_queue<pii> pq;
    pq.push({pd[st] = 0, st});
    while (SZ(pq)) {
        int v = pq.top().S; pq.pop();
        if (M[v]) continue;
        M[v] = 1;
        for (pii u : adj[v]) {
            if (pd[u.F] > pd[v] + u.S) {
                pd[u.F] = pd[v] + u.S;
                pq.push({-pd[u.F], u.F});
            }
        }
    }
    printf("%d\n", pd[en]);
    return 0;
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
portals.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |         scanf("%s", S + 1);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32364 KB Output is correct
2 Correct 25 ms 32492 KB Output is correct
3 Correct 22 ms 32620 KB Output is correct
4 Correct 22 ms 32364 KB Output is correct
5 Correct 22 ms 32492 KB Output is correct
6 Correct 22 ms 32492 KB Output is correct
7 Correct 22 ms 32492 KB Output is correct
8 Correct 24 ms 32492 KB Output is correct
9 Correct 23 ms 32364 KB Output is correct
10 Correct 22 ms 32364 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32364 KB Output is correct
2 Correct 22 ms 32512 KB Output is correct
3 Correct 24 ms 32492 KB Output is correct
4 Correct 22 ms 32364 KB Output is correct
5 Correct 22 ms 32492 KB Output is correct
6 Correct 24 ms 32492 KB Output is correct
7 Correct 22 ms 32492 KB Output is correct
8 Correct 22 ms 32492 KB Output is correct
9 Correct 23 ms 33516 KB Output is correct
10 Correct 23 ms 33516 KB Output is correct
11 Correct 23 ms 33388 KB Output is correct
12 Correct 25 ms 33516 KB Output is correct
13 Correct 23 ms 33516 KB Output is correct
14 Correct 22 ms 32364 KB Output is correct
15 Correct 24 ms 33516 KB Output is correct
16 Correct 22 ms 32364 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32384 KB Output is correct
2 Correct 23 ms 32492 KB Output is correct
3 Correct 22 ms 32492 KB Output is correct
4 Correct 22 ms 32492 KB Output is correct
5 Correct 36 ms 38252 KB Output is correct
6 Correct 37 ms 38380 KB Output is correct
7 Correct 37 ms 38508 KB Output is correct
8 Correct 34 ms 38636 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32364 KB Output is correct
2 Correct 23 ms 32492 KB Output is correct
3 Correct 22 ms 32492 KB Output is correct
4 Correct 22 ms 32364 KB Output is correct
5 Correct 23 ms 32492 KB Output is correct
6 Correct 26 ms 32492 KB Output is correct
7 Correct 23 ms 32492 KB Output is correct
8 Correct 22 ms 32492 KB Output is correct
9 Correct 23 ms 33516 KB Output is correct
10 Correct 23 ms 33516 KB Output is correct
11 Correct 23 ms 33388 KB Output is correct
12 Correct 23 ms 33516 KB Output is correct
13 Correct 24 ms 33516 KB Output is correct
14 Correct 35 ms 38252 KB Output is correct
15 Correct 35 ms 38380 KB Output is correct
16 Correct 38 ms 38508 KB Output is correct
17 Correct 36 ms 38636 KB Output is correct
18 Correct 40 ms 38892 KB Output is correct
19 Correct 43 ms 39660 KB Output is correct
20 Correct 43 ms 39532 KB Output is correct
21 Correct 36 ms 38380 KB Output is correct
22 Correct 35 ms 38380 KB Output is correct
23 Correct 36 ms 38380 KB Output is correct
24 Correct 41 ms 39532 KB Output is correct
25 Correct 22 ms 32364 KB Output is correct
26 Correct 23 ms 33516 KB Output is correct
27 Correct 22 ms 32364 KB Output is correct
28 Correct 33 ms 38636 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 32364 KB Output is correct
2 Correct 22 ms 32492 KB Output is correct
3 Correct 22 ms 32492 KB Output is correct
4 Correct 22 ms 32364 KB Output is correct
5 Correct 22 ms 32492 KB Output is correct
6 Correct 22 ms 32492 KB Output is correct
7 Correct 23 ms 32492 KB Output is correct
8 Correct 23 ms 32492 KB Output is correct
9 Correct 23 ms 33516 KB Output is correct
10 Correct 23 ms 33536 KB Output is correct
11 Correct 24 ms 33388 KB Output is correct
12 Correct 26 ms 33516 KB Output is correct
13 Correct 23 ms 33516 KB Output is correct
14 Correct 35 ms 38252 KB Output is correct
15 Correct 35 ms 38380 KB Output is correct
16 Correct 36 ms 38508 KB Output is correct
17 Correct 38 ms 38508 KB Output is correct
18 Correct 39 ms 38892 KB Output is correct
19 Correct 44 ms 39660 KB Output is correct
20 Correct 43 ms 39680 KB Output is correct
21 Correct 35 ms 38380 KB Output is correct
22 Correct 35 ms 38380 KB Output is correct
23 Correct 36 ms 38380 KB Output is correct
24 Correct 432 ms 110828 KB Output is correct
25 Correct 860 ms 135532 KB Output is correct
26 Correct 703 ms 135660 KB Output is correct
27 Correct 683 ms 135276 KB Output is correct
28 Correct 344 ms 101996 KB Output is correct
29 Correct 369 ms 103148 KB Output is correct
30 Correct 405 ms 104300 KB Output is correct
31 Correct 42 ms 39532 KB Output is correct
32 Correct 675 ms 135404 KB Output is correct
33 Correct 22 ms 32364 KB Output is correct
34 Correct 24 ms 33516 KB Output is correct
35 Correct 515 ms 116076 KB Output is correct
36 Correct 22 ms 32364 KB Output is correct
37 Correct 33 ms 38636 KB Output is correct
38 Correct 330 ms 109804 KB Output is correct
39 Correct 332 ms 96492 KB Output is correct