Submission #3415008
Source Code Expand
#include <iostream> #include <vector> #include <queue> using namespace std; int main(){ int R,C,sx,sy,gx,gy; cin>>R>>C>>sy>>sx>>gy>>gx; sx--;sy--;gx--;gy--; vector<vector<char> > map(R,vector<char>(C,'#')); for(int i=0;i<R;i++){ for(int j=0;j<C;j++){ cin>>map[i][j]; } } vector<vector<int> > cost(R,vector<int>(C,-1)); queue<int> x,y; x.push(sx);y.push(sy); cost[sy][sx]=0; while(x.size()>0){ int now_x=x.front(),now_y=y.front(); x.pop();y.pop(); if(now_y>0){ if(map[now_y-1][now_x]=='.'&&cost[now_y-1][now_x]<0){ x.push(now_x);y.push(now_y-1); cost[now_y-1][now_x]=cost[now_y][now_x]+1; } } if(now_y<(R-1)){ if(map[now_y+1][now_x]=='.'&&cost[now_y+1][now_x]<0){ x.push(now_x);y.push(now_y+1); cost[now_y+1][now_x]=cost[now_y][now_x]+1; } } if(now_x>0){ if(map[now_y][now_x-1]=='.'&&cost[now_y][now_x-1]<0){ x.push(now_x-1);y.push(now_y); cost[now_y][now_x-1]=cost[now_y][now_x]+1; } } if(now_x<(C-1)){ if(map[now_y][now_x+1]=='.'&&cost[now_y][now_x+1]<0){ x.push(now_x+1);y.push(now_y); cost[now_y][now_x+1]=cost[now_y][now_x]+1; } } } cout<<cost[gy][gx]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | rokube |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1330 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 |