Submission #3789002
Source Code Expand
#include <bits/stdc++.h> using namespace std; int dy[4]={-1,0,1,0}; int dx[4]={0,1,0,-1}; char board[51][51]; int r,c; int sy,sx,gy,gx; int main(void) { cin.tie(0); ios::sync_with_stdio(false); cin >> r >> c; cin >> sy >> sx; cin >> gy >> gx; for(int i=1;i<=r;i++) { for(int j=1;j<=c;j++) { cin >> board[i][j]; } } queue <pair<int,pair<int,int>>> que; que.push(make_pair(0,make_pair(sy,sx))); bool visited[51][51]={false,}; visited[sy][sx] = true; while(!que.empty()) { int t = que.front().first; int y = que.front().second.first; int x = que.front().second.second; que.pop(); if(y==gy && x==gx) { cout << t << '\n'; break; } for(int i=0;i<4;i++) { int ny = y + dy[i]; int nx = x + dx[i]; if(ny<=0 || ny>r || nx<=0 || nx>c) { continue; } if(visited[ny][nx]==false && board[ny][nx]=='.') { visited[ny][nx]=true; que.push(make_pair(t+1,make_pair(ny,nx))); } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | joker_x |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1037 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 |