Submission #2674064
Source Code Expand
#include <iostream> #include <queue> #include <utility> using namespace std; using P = pair<int, int>; const int INF = (int)1e8; int R, C; int sx, sy, gx, gy; char c[51][51]; int d[51][51]; int bfs(){ int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; queue<P> que; que.push(P(sy, sx)); d[sy][sx] = 0; while(not que.empty()){ P p = que.front(); que.pop(); int y = p.first, x = p.second; // cout << "(y, x) = " << y << ' ' << x << '\n'; if(y == gy and x == gx) break; for(int i = 0; i < 4; i++){ int ny = y + dy[i], nx = x + dx[i]; // cout << "---(ny, nx) = " << ny << nx << '\n'; if(0<=ny and ny<R and 0<=nx and nx<C and c[ny][nx]=='.' and d[ny][nx]==INF){ // cout << "reachable" << '\n'; d[ny][nx] = d[y][x] + 1; que.push(P(ny, nx)); } } } return d[gy][gx]; } int main(void){ cin >> R >> C; cin >> sy >> sx; sy--; sx--; cin >> gy >> gx; gy--; gx--; for(int i = 0; i < R; i++){ for(int j = 0; j < C; j++){ cin >> c[i][j]; d[i][j] = INF; } } cout << bfs() << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | yna87 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1281 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 |