Submission #1707606


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include<queue>
using namespace std;
typedef pair<int,int> P;

int main(){
  int R,C,sy,sx,gy,gx;
  cin>>R>>C>>sy>>sx>>gy>>gx;
  char maze[51][51];
  for(int i=1;i<=R;i++)
    for(int j=1;j<=C;j++)cin>>maze[j][i];
  int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};
  int d[51][51];
  
  //////////////// int bfs() {
    queue<P> que;
    for(int i=1;i<=R;i++)
      for(int j=1;j<=C;j++)d[j][i]=1000000007;
    
    que.push(P(sx,sy));
    d[sx][sy]=0;
    
    while (que.size()){
      P p=que.front();que.pop();
      if(p.first==gx&&p.second==gy)break;
      for(int i=0;i<4;i++){
	  int nx=p.first+dx[i],ny=p.second+dy[i];

	  if(1<=nx&&nx<=C&&1<=ny&&ny<=R&&maze[nx][ny]!='#'&&d[nx][ny]==1000000007){
	      que.push(P(nx,ny));
	      d[nx][ny]=d[p.first][p.second]+1;
	  }
      }
    }
    cout<<d[gx][gy]<<endl;
    return 0;
}

Submission Info

Submission Time
Task C - 幅優先探索
User Oike7
Language C++14 (GCC 5.4.1)
Score 100
Code Size 963 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 25
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 2 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 2 ms 256 KB
subtask1_17.txt AC 2 ms 256 KB
subtask1_18.txt AC 2 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