Submission #2673347
Source Code Expand
#include <iostream>
#include <typeinfo>
#include <cstdlib>
#include <queue>
#include <string>
#define NMAX 101
#define MMAX 101
#define INF 100000000
using namespace std;
typedef pair<int, int> P;
char maze[NMAX][MMAX];
int n, m, sx, sy, gx, gy;
int d[NMAX][MMAX];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int bfs(void) {
queue<P> que;
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++)
d[i][j] = INF;
}
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(int i=0; i<4; i++) {
int nx = p.first + dx[i], ny = p.second + dy[i];
if(0<=nx && nx<n && 0<=ny && ny<m && 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 >> n >> m >> sx >> sy >> gx >> gy;
for(int i=0; i<n; i++)
scanf("%s", maze[i]);
cout << bfs() << endl;
}
Submission Info
Submission Time
2018-06-16 17:20:25+0900
Task
C - 幅優先探索
User
eQe
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1169 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:49:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", maze[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
1 ms
256 KB
subtask0_sample02.txt
WA
1 ms
256 KB
subtask0_sample03.txt
WA
1 ms
256 KB
subtask1_01.txt
WA
1 ms
256 KB
subtask1_02.txt
WA
1 ms
256 KB
subtask1_03.txt
WA
1 ms
256 KB
subtask1_04.txt
WA
1 ms
256 KB
subtask1_05.txt
AC
1 ms
256 KB
subtask1_06.txt
WA
1 ms
256 KB
subtask1_07.txt
WA
1 ms
256 KB
subtask1_08.txt
WA
1 ms
256 KB
subtask1_09.txt
WA
1 ms
256 KB
subtask1_10.txt
WA
1 ms
256 KB
subtask1_11.txt
AC
1 ms
256 KB
subtask1_12.txt
AC
1 ms
256 KB
subtask1_13.txt
WA
1 ms
256 KB
subtask1_14.txt
WA
1 ms
256 KB
subtask1_15.txt
AC
1 ms
256 KB
subtask1_16.txt
WA
1 ms
256 KB
subtask1_17.txt
AC
1 ms
256 KB
subtask1_18.txt
WA
1 ms
256 KB
subtask1_19.txt
WA
1 ms
256 KB
subtask1_20.txt
WA
1 ms
256 KB
subtask1_21.txt
WA
1 ms
256 KB
subtask1_22.txt
WA
1 ms
256 KB