Submission #4626846
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define push_pair(a,b) push(make_pair((a),(b)))
#define pp(a,b) push_pair(a,b)
#define ff front().first
#define fs front().second
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int h,w,sx,sy,gx,gy;
cin>>h>>w>>sy>>sx>>gy>>gx;
sx--,sy--,gx--,gy--;
string board[h];
rep(i,h)cin>>board[i];
queue<pair<int,int>> pos;
bool visited[h][w]={false};
int score[h][w];
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
pos.pp(sy,sx);
visited[sy][sx]=true;
rep(i,h)rep(j,w)score[i][j]=1e9+7;
score[sy][sx]=0;
while(true){
rep(i,4){
int py=pos.ff+dy[i],px=pos.fs+dx[i];
if( board[py][px]=='#' )continue;
if( visited[py][px] )continue;
pos.pp(py,px);
score[py][px]=min( score[py][px],score[py-dy[i]][px-dx[i]]+1 );
visited[py][px]=true;
}
pos.pop();
if(pos.empty())break;
}
cout<<score[gy][gx]<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
ate |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
959 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 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 |
256 KB |
subtask1_01.txt |
AC |
1 ms |
256 KB |
subtask1_02.txt |
AC |
1 ms |
256 KB |
subtask1_03.txt |
AC |
1 ms |
256 KB |
subtask1_04.txt |
AC |
1 ms |
256 KB |
subtask1_05.txt |
AC |
1 ms |
256 KB |
subtask1_06.txt |
AC |
1 ms |
256 KB |
subtask1_07.txt |
AC |
1 ms |
256 KB |
subtask1_08.txt |
AC |
1 ms |
256 KB |
subtask1_09.txt |
AC |
1 ms |
256 KB |
subtask1_10.txt |
AC |
1 ms |
256 KB |
subtask1_11.txt |
AC |
1 ms |
256 KB |
subtask1_12.txt |
AC |
1 ms |
256 KB |
subtask1_13.txt |
AC |
1 ms |
256 KB |
subtask1_14.txt |
AC |
1 ms |
256 KB |
subtask1_15.txt |
AC |
1 ms |
256 KB |
subtask1_16.txt |
AC |
1 ms |
256 KB |
subtask1_17.txt |
AC |
1 ms |
256 KB |
subtask1_18.txt |
AC |
1 ms |
256 KB |
subtask1_19.txt |
AC |
1 ms |
256 KB |
subtask1_20.txt |
AC |
1 ms |
256 KB |
subtask1_21.txt |
AC |
1 ms |
256 KB |
subtask1_22.txt |
AC |
1 ms |
256 KB |