oj.uz

답안 #512235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
512235 2022-01-16T08:07:14 Z 79brue Dangerous Skating (JOI16_skating) C++14
0 / 100
 1 ms 432 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int xx[] = {1, 0, -1, 0};
const int yy[] = {0, 1, 0, -1};

struct dat{
    int x, y, d, w;
    dat(){}
    dat(int x, int y, int d, int w): x(x), y(y), d(d), w(w){}

    bool operator<(const dat &r)const{
        return w>r.w;
    }
};

int n, m;
bool arr[1005][1005];
int wallX[1005][1005][4], wallY[1005][1005][4];
bool visited[1005][1005][5];

int r1, c1;
int r2, c2;
priority_queue<dat> que;

void makeWall(){
    for(int i=1; i<=n; i++){
        for(int j=m; j>=1; j--){
            if(arr[i][j]) wallX[i][j][1] = i, wallY[i][j][1] = j-1;
            else wallX[i][j][1] = wallX[i][j+1][1], wallY[i][j][1] = wallY[i][j+1][1];
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(arr[i][j]) wallX[i][j][3] = i, wallY[i][j][3] = j+1;
            else wallX[i][j][3] = wallX[i][j-1][3], wallY[i][j][3] = wallY[i][j-1][3];
        }
    }
    for(int i=n; i>=1; i--){
        for(int j=1; j<=m; j++){
            if(arr[i][j]) wallX[i][j][0] = i-1, wallY[i][j][0] = j;
            else wallX[i][j][0] = wallX[i+1][j][0], wallY[i][j][0] = wallY[i+1][j][0];
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(arr[i][j]) wallX[i][j][2] = i+1, wallY[i][j][2] = j;
            else wallX[i][j][2] = wallX[i-1][j][2], wallY[i][j][2] = wallY[i-1][j][2];
        }
    }
}

void queueInsert(int x, int y, int d, int w){
    if(visited[x][y][d] || arr[x][y]) return;
    que.push(dat(x, y, d, w));
    visited[x][y][d] = 1;
}

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);
            arr[i][j] = (c == '#');
        }
    }
    scanf("%d %d %d %d", &r1, &c1, &r2, &c2);

    makeWall();

    que.push(dat(r1, c1, 4, 0));
    visited[r1][c1][4] = 1;
    while(!que.empty()){
        dat tmp = que.top(); que.pop();
        int x = tmp.x, y = tmp.y, d = tmp.d, w = tmp.w;
//        printf("%d %d %d %d\n", x, y, d, w);
        if(x == r2 && y == c2){
            printf("%d", w);
            return 0;
        }

        for(int i=0; i<4; i++){
            queueInsert(wallX[x][y][i], wallY[x][y][i], i, w+1);
            if(arr[x-xx[i]][y-yy[i]] || d==(i^2)) queueInsert(x+xx[i], y+yy[i], i^2, w+2);
        }
    }

    printf("-1");
}

Compilation message

skating.cpp: In function 'int main()':
skating.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
skating.cpp:67:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |             scanf(" %c", &c);
      |             ~~~~~^~~~~~~~~~~
skating.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Incorrect 0 ms 428 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Incorrect 0 ms 428 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Incorrect 0 ms 428 KB Output isn't correct
4 Halted 0 ms 0 KB -