Submission #1511743
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define FOR(I,A,B) for(int i=A;i<B;i++)
#define INF 1000000
int r,c,sx,sy,gx,gy;
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int d[1000][1000];
char maze[1000][1000];
int bfs(){
FOR(i,1,r+1){
for(int j=1;j<c+1;j++){
d[i][j]=INF;
}
}
queue<P> que;
que.push(P(sx,sy));
d[sx][sy]=0;
while(que.size()){
P p=que.front();que.pop();
if(p.first==gx&&p.second==gy) break;
FOR(i,0,4){
int nx=p.first+dx[i];
int ny=p.second+dy[i];
if(0<=nx&&nx<r&&0<=ny&&ny<c&&maze[nx][ny]!='#'&&d[nx][ny]==INF){
que.push(P(nx,ny));
d[nx][ny]=d[p.first][p.second]+1;
}
}
}
return d[gx][gy];
}
int main(void){
cin>>r>>c>>sx>>sy>>gx>>gy;
FOR(i,1,r+1){
for(int j=1;j<c+1;j++){
cin>>maze[i][j];
}
}
int res=bfs();
cout<<res<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
min1 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1045 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All |
subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample01.txt |
AC |
1 ms |
256 KB |
subtask0_sample02.txt |
AC |
1 ms |
256 KB |
subtask0_sample03.txt |
AC |
1 ms |
512 KB |
subtask1_01.txt |
AC |
1 ms |
512 KB |
subtask1_02.txt |
AC |
1 ms |
512 KB |
subtask1_03.txt |
AC |
1 ms |
512 KB |
subtask1_04.txt |
AC |
1 ms |
512 KB |
subtask1_05.txt |
AC |
1 ms |
512 KB |
subtask1_06.txt |
AC |
1 ms |
512 KB |
subtask1_07.txt |
AC |
1 ms |
256 KB |
subtask1_08.txt |
AC |
1 ms |
512 KB |
subtask1_09.txt |
AC |
1 ms |
512 KB |
subtask1_10.txt |
AC |
1 ms |
512 KB |
subtask1_11.txt |
AC |
1 ms |
512 KB |
subtask1_12.txt |
AC |
1 ms |
512 KB |
subtask1_13.txt |
AC |
1 ms |
512 KB |
subtask1_14.txt |
AC |
1 ms |
512 KB |
subtask1_15.txt |
AC |
1 ms |
512 KB |
subtask1_16.txt |
AC |
1 ms |
512 KB |
subtask1_17.txt |
AC |
1 ms |
512 KB |
subtask1_18.txt |
AC |
1 ms |
512 KB |
subtask1_19.txt |
AC |
1 ms |
512 KB |
subtask1_20.txt |
AC |
1 ms |
512 KB |
subtask1_21.txt |
AC |
1 ms |
512 KB |
subtask1_22.txt |
AC |
1 ms |
512 KB |