Submission #1512397
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <stack> #include <queue> #include <set> #include <map> #include <utility> #include <ctime> #define INF 2000000000 #define LINF 9000000000000000000 #define mod 1000000007 #define rep(i,n) for(int i=0;i<int(n);i++) #define rrep(i,n) for(int i=(n);i>=0;i--) #define REP(i,a,b) for(int i=(a);i<int(b);i++) #define all(x) (x).begin(),x.end() #define pb push_back #define mp make_pair #define MOD(x) (x%(mod)) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef pair<int,int> pi; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; bool debug=false; /*---------------------------------------------------*/ int r,c; int sy,sx; int gy,gx; int cost[55][55]; char maze[55][55]; void init(){ rep(i,55){ rep(j,55){ maze[i][j]='#'; cost[i][j]=INF; } } } int bfs(){ queue<int> que; que.push(sx);que.push(sy); maze[sy][sx]='#'; cost[sy][sx]=0; while(!que.empty()){ int x=que.front();que.pop(); int y=que.front();que.pop(); rep(i,4){ if(0<=x+dx[i]&&x+dx[i]<c&&0<=y+dy[i]&&y+dy[i]<r&&maze[y+dy[i]][x+dx[i]]=='.'){ que.push(x+dx[i]);que.push(y+dy[i]); cost[y+dy[i]][x+dx[i]]=cost[y][x]+1; maze[y+dy[i]][x+dx[i]]='#'; } } } return cost[gy][gx]; } int main(){ cin>>r>>c>>sy>>sx>>gy>>gx; sy--;sx--;gx--;gy--; init(); rep(i,r)rep(j,c)cin>>maze[i][j]; cout<<bfs()<<endl;; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | mkan_0141 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1639 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 |