Submission #1437394
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <queue> #include <map> #include <utility> #include <functional> using namespace std; int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; int main() { int r, c, sx, sy, gx, gy; char f[51][51]; cin >> r >> c >> sy >> sx >> gy >> gx; for (int i = 1; i <= r; ++i) { for (int j = 1; j <= c; ++j) { cin >> f[i][j]; } } bool visit[51][51] = { false }, finish = false; queue<pair<int, int>> que; que.push(make_pair(sy, sx)); int ans = 0; while (!que.empty()) { for (int i = 0, size = que.size(); i < size; ++i) { auto tmp = que.front(); que.pop(); if (tmp.first == gy && tmp.second == gx) { finish = true; break; } for (int j = 0; j < 4; ++j) { int ny = tmp.first + dy[j]; int nx = tmp.second + dx[j]; if (ny < 1 || ny > r || nx < 1 || nx > c || f[ny][nx] == '#' ||visit[ny][nx]) { continue; } visit[ny][nx] = true; que.push(make_pair(ny, nx)); } } if (finish) break; ans++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | temple |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1143 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 |