Submission #1498041


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;

typedef pair<int, int> P;
queue<P> que;
int h,w;
int sx,sy,gx,gy;
char mp[111][111];
int nmp[111][111];
int nx[] = { 0, 1, 0,-1};
int ny[] = { 1, 0,-1, 0};

int main(){
  for(int i=0;i<111;i++)for(int j=0;j<111;j++)nmp[i][j] = -1;

  scanf(" %d %d",&h,&w);
  scanf(" %d %d",&sy,&sx);
  scanf(" %d %d",&gy,&gx);
  for(int i=0;i<h;i++){
    scanf(" %s",mp[i]);
  }

  sx--;sy--;gx--;gy--;

  que.push(P(sy,sx));
  nmp[sy][sx] = 0;
  while(!que.empty()){
    P q = que.front(); que.pop();
    int y = q.first;
    int x = q.second;
    for(int i=0;i<4;i++){
      int yy = y+ny[i];
      int xx = x+nx[i];
      if(yy >= 0 && xx >= 0 && yy < h && xx < w && mp[yy][xx] == '.' && nmp[yy][xx] == -1){
        nmp[yy][xx] = nmp[y][x] + 1;
        que.push(P(yy,xx));
      }
    }
  }

  printf("%d\n",nmp[gy][gx]);

  /*
  printf("\n");
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      printf("%3d ",nmp[i][j]);
    }
    printf("\n");
  }
  */
  return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %d %d",&h,&w);
                        ^
./Main.cpp:20:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %d %d",&sy,&sx);
                          ^
./Main.cpp:21:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %d %d",&gy,&gx);
                          ^
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %s",mp[i]);
                       ^

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