Submission #2673337
Source Code Expand
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int R, C, sy, sx, gy, gx;
char c[55][55];
cin >> R >> C >> sy >> sx >> gy >> gx;
for(int i=1; i<=R; i++)
scanf("%s", c[i]);
queue<pair<int, int> > qp;
qp.push(make_pair(sy, sx));
int inf = 2 << 29, d[55][55];
for (int i = 1; i <= R; i++)
for (int j = 1; j <= C; j++)
d[i][j] = inf;
d[sy][sx] = 0;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
while (qp.size()) {
auto p = qp.front();
qp.pop();
if(p.first==gx && p.second==gy) break;
for (int i = 0; i < 4; i++) {
int nx = p.second + dx[i];
int ny = p.first + dy[i];
if (0 <= nx && nx < C && 0 <= ny && ny < R && c[ny][nx] == '.' && d[ny][nx] == inf) {
d[ny][nx] = d[p.first][p.second] + 1;
qp.push(make_pair(ny, nx));
}
}
}
cout << d[gy][gx] << endl;
return 0;
}
Submission Info
Submission Time
2018-06-16 17:17:42+0900
Task
C - 幅優先探索
User
eQe
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1093 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:12:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", c[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
AC
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
WA
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