Submission #691251
Source Code Expand
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>
int R, C;
int sy, sx;
int gy, gx;
char field[64][64];
int dist[64][64];
int main() {
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
for(int i = 0; i < 64; ++i) {
for(int j = 0; j < 64; ++j) {
dist[i][j] = (1 << 30);
}
}
scanf("%d %d", &R, &C);
scanf("%d %d", &sy, &sx);
scanf("%d %d", &gy, &gx);
for(int i = 0; i < R; ++i) {
scanf("%s", field[i]);
}
sy -= 1;
sx -= 1;
gx -= 1;
gy -= 1;
std::queue<std::pair<int, int> > q;
q.push(std::pair<int, int>(sy, sx));
dist[sy][sx] = 0;
while( not q.empty() ) {
std::pair<int, int> yx = q.front(); q.pop();
int y = yx.first;
int x = yx.second;
for(int i = 0; i < 4; ++i) {
int ny = y + dy[i];
int nx = x + dx[i];
if( not ( 0 <= ny and ny < R and 0 <= nx and nx < C ) ) continue;
if( field[ny][nx] == '#' ) continue;
if( dist[ny][nx] <= dist[y][x] + 1 ) continue;
dist[ny][nx] = dist[y][x] + 1;
q.push(std::pair<int, int>(ny, nx));
}
}
printf("%d\n", dist[gy][gx]);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 幅優先探索 |
User |
spica314 |
Language |
C++14 (Clang 3.8.0) |
Score |
100 |
Code Size |
1319 Byte |
Status |
AC |
Exec Time |
12 ms |
Memory |
888 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 |
12 ms |
888 KB |
subtask0_sample02.txt |
AC |
5 ms |
256 KB |
subtask0_sample03.txt |
AC |
4 ms |
256 KB |
subtask1_01.txt |
AC |
4 ms |
256 KB |
subtask1_02.txt |
AC |
4 ms |
256 KB |
subtask1_03.txt |
AC |
4 ms |
256 KB |
subtask1_04.txt |
AC |
4 ms |
256 KB |
subtask1_05.txt |
AC |
4 ms |
256 KB |
subtask1_06.txt |
AC |
4 ms |
256 KB |
subtask1_07.txt |
AC |
4 ms |
256 KB |
subtask1_08.txt |
AC |
4 ms |
256 KB |
subtask1_09.txt |
AC |
4 ms |
256 KB |
subtask1_10.txt |
AC |
4 ms |
256 KB |
subtask1_11.txt |
AC |
4 ms |
256 KB |
subtask1_12.txt |
AC |
4 ms |
256 KB |
subtask1_13.txt |
AC |
4 ms |
256 KB |
subtask1_14.txt |
AC |
4 ms |
256 KB |
subtask1_15.txt |
AC |
4 ms |
256 KB |
subtask1_16.txt |
AC |
4 ms |
256 KB |
subtask1_17.txt |
AC |
6 ms |
256 KB |
subtask1_18.txt |
AC |
5 ms |
256 KB |
subtask1_19.txt |
AC |
4 ms |
256 KB |
subtask1_20.txt |
AC |
4 ms |
256 KB |
subtask1_21.txt |
AC |
4 ms |
256 KB |
subtask1_22.txt |
AC |
4 ms |
256 KB |