Submission #3911772


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

#define mp make_pair

const int INF = 1e+9;

int main()
{
  int r, c;
  cin >> r >> c;
  
  int sx, sy, gx, gy;
  cin >> sy >> sx >> gy >> gx;
  sx--; sy--; gx--; gy--;

  char cc[r][c];
  int d[r][c];
  for(int i = 0; i < r; i++){
    cin >> cc[i];
    for(int j = 0; j < c; j++){
      d[i][j] = INF;
    }
  }

  queue<pii> que;
  que.push(mp(sx, sy));
  d[sy][sx] = 0;

  int dx[] = {1, -1, 0, 0};
  int dy[] = {0, 0, 1, -1};

  while(!que.empty()){
    pii p = que.front();
    que.pop();

//    cout << p.first << ", " << p.second << endl;

    for(int i = 0; i < 4; i++){
      int nx = p.first + dx[i];
      int ny = p.second + dy[i];

      if(cc[ny][nx] == '.' and d[ny][nx] > d[p.second][p.first] + 1){
        d[ny][nx] = d[p.second][p.first] + 1;
        que.push(mp(nx, ny));
      }
    }
  }

  cout << d[gy][gx] << endl;

  return 0;
}

Submission Info

Submission Time
Task C - 幅優先探索
User yuto953
Language C++14 (GCC 5.4.1)
Score 100
Code Size 985 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