Submission #6938027

---

Source Code Expand

// 深さ優先探索
#include <iostream>
#include <vector>

using namespace std;

vector<vector<char>> Maze;
vector<vector<int>> Turn;

void depth_search(int x, int y, int t){
    if(Maze[x][y]=='.'){
        if(Turn[x][y] > t){
            Turn[x][y] = t;
            depth_search(x+1, y, t+1);
            depth_search(x-1, y, t+1);
            depth_search(x, y+1, t+1);
            depth_search(x, y-1, t+1);
        }
    }
}

int main(void){
    int R, C, sx, sy, gx, gy;
    char m;
    cin >> R >> C >> sx >> sy >> gx >> gy;
    Maze.assign(R+2, vector<char>(C+2));
    Turn.assign(R+2, vector<int>(C+2, 10000));
    
    for(int r=0; r<R+2; r++){
        Maze[r][0] = '#';
        Maze[r][C+1] = '#';
    }
    for(int c=0; c<C+2; c++){
        Maze[0][c] = '#';
        Maze[R+1][c] = '#';
    }
    for(int r=1; r<=R; r++){
        for(int c=1; c<=C; c++){
            cin >>Maze[r][c]; 
        }
    }
    
    depth_search(sx, sy, 0);
    cout << Turn[gx][gy];
    return 0;
}

Submission Info

Judge Result