Submission #3687754
Source Code Expand
#include<iostream>
#include<queue>
void bfs(int x,int y,char *map,int *score,int c) {
std::queue<std::pair<int, int>> Q;
score[y*c + x] = 0;
Q.push(std::make_pair(x, y));
int dx[] = { 0,0,1,-1 };
int dy[] = { 1,-1,0,0 };
while (!Q.empty()) {
std::pair<int, int>q = Q.front();
x = q.first;
y = q.second;
Q.pop();
for (int i = 0; i < 4; i++) {
int a = dx[i] + x;
int b = dy[i] + y;
if (score[b*c + a] != -1 || map[b*c + a] == '#')continue;
score[b*c + a] = score[y*c + x] + 1;
Q.push(std::make_pair(a, b));
}
}
}
int main() {
int r, c, sy, sx, gy, gx;
std::cin >> r >> c >> sy >> sx >> gy >> gx;
char *map = new char[r*c + 1];
int *score = new int[r*c];
for (int i = 0; i < r*c; i++) {
std::cin >> map[i/c*c+i%c];
score[i] = -1;
}
bfs(sx - 1, sy - 1, map, score, c);
printf("%d", score[(gy - 1)*c + gx - 1]);
}
Submission Info
Submission Time |
|
Task |
C - 幅優先探索 |
User |
po_ultra |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
891 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
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 |
WA |
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 |
WA |
1 ms |
256 KB |
subtask1_12.txt |
WA |
1 ms |
256 KB |
subtask1_13.txt |
WA |
1 ms |
256 KB |
subtask1_14.txt |
WA |
1 ms |
256 KB |
subtask1_15.txt |
WA |
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 |