Submission #1204356
Source Code Expand
#include<iostream> using namespace std; #include<queue> bool used[50][50]; string s[50]; int r,c,sx,sy,gx,gy; int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; int d[50][50]; void bfs(int x,int y) { queue<pair<int,int> >P; d[x][y]=0; P.push(make_pair(x,y)); while(!P.empty()) { pair<int,int>p=P.front();P.pop(); int nx=p.first,ny=p.second; used[nx][ny]=true; for(int r=0;r<4;r++) { int tx=nx+dx[r],ty=ny+dy[r]; if(s[tx][ty]=='#'||used[tx][ty])continue; d[tx][ty]=d[nx][ny]+1;used[tx][ty]=true; P.push(make_pair(tx,ty)); } } } main() { cin>>r>>c>>sx>>sy>>gx>>gy; for(int i=0;i<r;i++)cin>>s[i]; bfs(sx-1,sy-1); cout<<d[gx-1][gy-1]<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | kotatsugame |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 693 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 |