Submission #2175225
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ int h, w; //height width cin >> h >> w; int sx, sy, gx, gy; //start x, y goal x, y cin >> sx >> sy; cin >> gx >> gy; sx--; sy--; gx--; gy--; //align to beginning zero char C[60][60]; //maze int R[60][60]; //route count (procedure number) for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ cin >> C[i][j]; R[i][j] = 1e9; //inaccessible place initialized with huge number } } int dx[4] = {1, 0, -1, 0}; //four directions pair of x and y int dy[4] = {0, 1, 0, -1}; //four directions pair of x and y queue<pair<int, int>> q; q.push(make_pair(sx, sy)); R[sx][sy] = 0; //starting point while(q.size()){ pair<int, int> tmp = q.front(); q.pop(); for(int i = 0; i < 4; i++){ //dx[], dy[] loop int nx = tmp.first + dx[i]; int ny = tmp.second + dy[i]; if(nx < 0 or ny < 0 or nx >= h or ny >= w or C[nx][ny] == '#'){ continue; } if(R[tmp.first][tmp.second] + 1 < R[nx][ny]){ //R[a][b] is the minimum number of steps up to C[a][b] R[nx][ny] = R[tmp.first][tmp.second] + 1; q.push(make_pair(nx, ny)); } } } cout << R[gx][gy] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | tokizo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1429 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 |