oj.uz

Submission #843957

# Submission time Handle Problem Language Result Execution time Memory
843957 2023-09-04T18:05:01 Z mickey080929 None (JOI16_skating) C++14
100 / 100
 114 ms 41100 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int inf = 1e9;

int n, m;
int sx, sy, ex, ey;
int A[1010][1010];
pii L[1010][1010], R[1010][1010], U[1010][1010], D[1010][1010];
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int vis[1010][1010];

int main() {
    scanf("%d %d", &n, &m);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            char c;
            scanf(" %c", &c);
            if (c == '#') A[i][j] = 0;
            else A[i][j] = 1;
        }
    }
    scanf("%d %d", &sx, &sy);
    scanf("%d %d", &ex, &ey);
    for (int i=1; i<=n; i++) {
        int p = 1;
        for (int j=2; j<=m; j++) {
            if (!A[i][j]) p = j;
            else L[i][j] = {i, p+1};
        }
        p = m;
        for (int j=m-1; j>=1; j--) {
            if (!A[i][j]) p = j;
            else R[i][j] = {i, p-1};
        }
    }
    for (int j=1; j<=m; j++) {
        int p = 1;
        for (int i=2; i<=n; i++) {
            if (!A[i][j]) p = i;
            else U[i][j] = {p+1, j};
        }
        p = n;
        for (int i=n-1; i>=1; i--) {
            if (!A[i][j]) p = i;
            else D[i][j] = {p-1, j};
        }
    }
    vector<pii> q1, q2, q3;
    q1.push_back({sx, sy});
    vis[sx][sy] = 1;
    int t = 0;
    while (!q1.empty() || !q2.empty()) {
        for (auto &[x, y] : q1) {
            if (x == ex && y == ey) {
                printf("%d\n", t);
                return 0;
            }
            for (auto &[nx, ny] : {L[x][y], R[x][y], U[x][y], D[x][y]}) {
                if (vis[nx][ny]) continue;
                vis[nx][ny] = 1;
                q2.push_back({nx, ny});
            }
        }
        for (auto &[x, y] : q1) {
            for (int i=0; i<4; i++) {
                int nx = x + dx[i];
                int ny = y + dy[i];
                if (!A[nx][ny]) continue;
                if (vis[nx][ny]) continue;
                vis[nx][ny] = 1;
                q3.push_back({nx, ny});
            }
        }
        q1 = q2;
        q2 = q3;
        q3.clear();
        t ++;
    }
    printf("-1\n");
}

Compilation message

skating.cpp: In function 'int main()':
skating.cpp:59:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   59 |         for (auto &[x, y] : q1) {
      |                    ^
skating.cpp:64:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |             for (auto &[nx, ny] : {L[x][y], R[x][y], U[x][y], D[x][y]}) {
      |                        ^
skating.cpp:70:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |         for (auto &[x, y] : q1) {
      |                    ^
skating.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
skating.cpp:23:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |             scanf(" %c", &c);
      |             ~~~~~^~~~~~~~~~~
skating.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%d %d", &sx, &sy);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
skating.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%d %d", &ex, &ey);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10788 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 2 ms 10744 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 1 ms 10584 KB Output is correct
10 Correct 1 ms 10584 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10788 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 2 ms 10744 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 1 ms 10584 KB Output is correct
10 Correct 1 ms 10584 KB Output is correct
11 Correct 5 ms 21084 KB Output is correct
12 Correct 5 ms 21080 KB Output is correct
13 Correct 4 ms 21080 KB Output is correct
14 Correct 7 ms 19544 KB Output is correct
15 Correct 4 ms 18904 KB Output is correct
16 Correct 5 ms 19800 KB Output is correct
17 Correct 6 ms 20952 KB Output is correct
18 Correct 5 ms 19544 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 4 ms 19288 KB Output is correct
21 Correct 4 ms 19544 KB Output is correct
22 Correct 4 ms 19548 KB Output is correct
23 Correct 5 ms 21080 KB Output is correct
24 Correct 5 ms 19544 KB Output is correct
25 Correct 5 ms 21080 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10788 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 2 ms 10744 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 1 ms 10584 KB Output is correct
10 Correct 1 ms 10584 KB Output is correct
11 Correct 5 ms 21084 KB Output is correct
12 Correct 5 ms 21080 KB Output is correct
13 Correct 4 ms 21080 KB Output is correct
14 Correct 7 ms 19544 KB Output is correct
15 Correct 4 ms 18904 KB Output is correct
16 Correct 5 ms 19800 KB Output is correct
17 Correct 6 ms 20952 KB Output is correct
18 Correct 5 ms 19544 KB Output is correct
19 Correct 5 ms 19548 KB Output is correct
20 Correct 4 ms 19288 KB Output is correct
21 Correct 4 ms 19544 KB Output is correct
22 Correct 4 ms 19548 KB Output is correct
23 Correct 5 ms 21080 KB Output is correct
24 Correct 5 ms 19544 KB Output is correct
25 Correct 5 ms 21080 KB Output is correct
26 Correct 6 ms 21080 KB Output is correct
27 Correct 72 ms 40364 KB Output is correct
28 Correct 107 ms 41100 KB Output is correct
29 Correct 44 ms 40388 KB Output is correct
30 Correct 66 ms 40756 KB Output is correct
31 Correct 53 ms 37968 KB Output is correct
32 Correct 75 ms 40356 KB Output is correct
33 Correct 19 ms 31312 KB Output is correct
34 Correct 56 ms 40148 KB Output is correct
35 Correct 71 ms 40444 KB Output is correct
36 Correct 75 ms 40376 KB Output is correct
37 Correct 59 ms 40016 KB Output is correct
38 Correct 114 ms 41064 KB Output is correct
39 Correct 75 ms 40300 KB Output is correct
40 Correct 48 ms 40272 KB Output is correct