Submission #1814666
Source Code Expand
#include <iostream> #include <queue> #include <utility> using namespace std; int main(){ queue<int> qx; queue<int> qy; int r,c; cin>>r>>c; int sy,sx,gy,gx; cin>>sy>>sx>>gy>>gx; char maze[60][60]; for(int i=0;i<r;i++){ for(int j=0;j<c;j++){ cin>>maze[i][j]; } } int mazea[60][60]={}; mazea[sy-1][sx-1]=1; qx.push(sx-1); qy.push(sy-1); while(!qx.empty()){ int x,y; x=qx.front(); y=qy.front(); //cout<<y<<" "<<x<<endl; qx.pop(); qy.pop(); if(maze[y][x+1]=='.'&&mazea[y][x+1]==0){ qx.push(x+1); qy.push(y); mazea[y][x+1]=mazea[y][x]+1; } if(maze[y][x-1]=='.'&&mazea[y][x-1]==0){ qx.push(x-1); qy.push(y); mazea[y][x-1]=mazea[y][x]+1; } if(maze[y+1][x]=='.'&&mazea[y+1][x]==0){ qx.push(x); qy.push(y+1); mazea[y+1][x]=mazea[y][x]+1; } if(maze[y-1][x]=='.'&&mazea[y-1][x]==0){ qx.push(x); qy.push(y-1); mazea[y-1][x]=mazea[y][x]+1; } } cout<<mazea[gy-1][gx-1]-1<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 幅優先探索 |
User | kanu |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1309 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 |