Submission #3025657


Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<queue>
using namespace std;
char map[55][55];
int passed[55][55];
queue<int> qy,qx;

void bfs(queue<int> qy, queue<int> qx, int gy, int gx,vector<int> x,vector<int> y){
  while(qy.size()){
    for(int i=0; i<4; i++){
        int ny = qy.front()+y.at(i);
        int nx = qx.front()+x.at(i);
       if(map[ny][nx] == '.' && passed[ny][nx] == 0){
         passed[ny][nx] = passed[qy.front()][qx.front()]+1;
         if(ny==gy && nx == gx)
         return;
         qy.push(ny);
         qx.push(nx);
       }
    }
    qy.pop();
    qx.pop();
  }
}


int main(){
  int r,c;
  cin >> r >> c;
  int sy,sx;
  cin >> sy >> sx;
  sy--;
  sx--;
  int gy,gx;
  cin >> gy >> gx;
  gy--;
  gx--;
  for(int i=0; i<r; i++){
     for(int j=0; j<c; j++){
        cin >> map[i][j];
        passed[i][j] = 0;
     }
  }
  vector<int> x = {0,1,0,-1};
  vector<int> y = {1,0,-1,0};
  qy.push(sy);
  qx.push(sx);
  passed[qy.front()][qx.front()] = 0;
  int ans = 0;
  bfs(qy,qx,gy,gx,x,y);
  ans = passed[gy][gx];
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - 幅優先探索
User Quant
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1136 Byte
Status AC
Exec Time 1 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 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