Submission #4231414
Source Code Expand
#include<bits/stdc++.h> using namespace std ; typedef pair<int,int> P ; const int INF = 100000000; int H , W ; int sx , sy ; int gx , gy ; int board[60][60] ; int nul[60][60] ; int dx[4] = {-1,1,0,0} , dy[4] = {0,0,-1,1} ; int bfs(){ for(int i = 0 ; i < H ; i++ ) for(int j = 0 ; j < W ; j++) nul[i][j] = INF ; queue<P> que ; que.push(P(sx-1,sy-1)) ; nul[sx-1][sy-1] = 0 ; while(que.size()){ P p = que.front() ; que.pop() ; if(p.first == gx-1 && p.second == gy-1 ) break; for(int i = 0 ; i < 4 ; i++ ){ int nx = p.first + dx[i] , ny = p.second + dy[i] ; if( nx >= 0 && ny >= 0 && nx < H && ny < W && board[nx][ny] == 0 && nul[nx][ny] == INF ){ que.push(P(nx,ny)) ; nul[nx][ny] = nul[p.first][p.second] + 1 ; } } } return nul[gx-1][gy-1] ; } int main () { //入力 cin >> H >> W ; cin >> sx >> sy >> gx >> gy ; char a ; for(int i = 0 ; i < H ; i++ ){ for(int j = 0 ; j < W ; j++ ){ cin >> a ; if(a=='#') board[i][j] = 1 ; else board[i][j] = 0 ; } } //処理部 int ans = bfs() ; cout << ans << endl ; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | k11200070 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1189 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
subtask1_01.txt | AC | 2 ms | 256 KB |
subtask1_02.txt | AC | 2 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 | 2 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 |