Submission #162405
Source Code Expand
#include <iostream> #include <queue> using namespace std; int main() { int R, C, sx, sy, gx, gy; int map[60][60] = {}; cin >> R >> C >> sx >> sy >> gx >> gy; sx--; sy--; gx--; gy--; int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; for (int i = 0; i < R; i++) { string s; cin >> s; for (int j = 0; j < C; j++) { if (s[j] == '.') { map[i][j] = 99999; } else { map[i][j] = -1; } } } queue <pair<int, int> > q; map[sx][sy] = 0; q.push(make_pair(sy, sx)); while(!q.empty()) { int cx = q.front().first, cy = q.front().second; q.pop(); int dist = map[cx][cy]; if (cx == gx && cy== gy) { cout << dist << endl; break; } // cout << cx << " " << cy << " " << dist << endl; for (int i = 0; i < 4; i++) { int nx = cx + dx[i], ny = cy + dy[i]; if (map[nx][ny] <= dist + 1) continue; map[nx][ny] = dist + 1; q.push(make_pair(nx, ny)); } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | biochemfan |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1030 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 932 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 | 22 ms | 800 KB |
subtask0_sample02.txt | AC | 22 ms | 924 KB |
subtask0_sample03.txt | AC | 22 ms | 924 KB |
subtask1_01.txt | AC | 24 ms | 800 KB |
subtask1_02.txt | AC | 23 ms | 928 KB |
subtask1_03.txt | AC | 23 ms | 788 KB |
subtask1_04.txt | AC | 22 ms | 932 KB |
subtask1_05.txt | AC | 24 ms | 800 KB |
subtask1_06.txt | AC | 26 ms | 796 KB |
subtask1_07.txt | AC | 23 ms | 912 KB |
subtask1_08.txt | AC | 23 ms | 812 KB |
subtask1_09.txt | AC | 22 ms | 920 KB |
subtask1_10.txt | AC | 24 ms | 928 KB |
subtask1_11.txt | AC | 23 ms | 924 KB |
subtask1_12.txt | AC | 22 ms | 800 KB |
subtask1_13.txt | AC | 25 ms | 924 KB |
subtask1_14.txt | AC | 23 ms | 928 KB |
subtask1_15.txt | AC | 33 ms | 932 KB |
subtask1_16.txt | AC | 28 ms | 928 KB |
subtask1_17.txt | AC | 22 ms | 812 KB |
subtask1_18.txt | AC | 22 ms | 932 KB |
subtask1_19.txt | AC | 26 ms | 928 KB |
subtask1_20.txt | AC | 26 ms | 796 KB |
subtask1_21.txt | AC | 23 ms | 928 KB |
subtask1_22.txt | AC | 23 ms | 848 KB |