Submission #1960299


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int d[50][50];
int q[2500][2];
int dx[4]={-1,0,1,0};
int dy[4]={0,1,0,-1};
char c[50][51];
int R,C;
void bfs(int y,int x){
    d[y][x]=0;
    q[0][0]=y;
    q[0][1]=x;
    int cnt=1;
    while(q[0][0]!=-1){
        int ny=q[0][0],nx=q[0][1];
        int i;
        for(i=0;i<cnt;i++){
            q[i][0]=q[i+1][0];
            q[i][1]=q[i+1][1];
        }
        cnt--;
        for(i=0;i<4;i++){
            if(ny+dy[i]>=0&&ny+dy[i]<R&&nx+dx[i]<C&&nx+dx[i]>=0){
                if(d[ny+dy[i]][nx+dx[i]]>=10000&&c[ny+dy[i]][nx+dx[i]]=='.'){
                    d[ny+dy[i]][nx+dx[i]]=d[ny][nx]+1;
                    q[cnt][0]=ny+dy[i];
                    q[cnt][1]=nx+dx[i];
                    cnt++;
                }
            }
        }
    }
}

int main()
{
    int sy,sx;
    int gy,gx;
    scanf("%d %d",&R,&C);
    scanf("%d %d",&sy,&sx);
    scanf("%d %d",&gy,&gx);
    int i,j;
    for(i=0;i<R;i++){
        scanf("%s",c[i]);
    }
    memset(d,10000,sizeof(d));
    memset(q,-1,sizeof(q));
    bfs(sy-1,sx-1);
    printf("%d\n",d[gy-1][gx-1]);
    return 0;
}

Submission Info

Submission Time
Task C - 幅優先探索
User kokubun0293
Language C (GCC 5.4.1)
Score 100
Code Size 1189 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:41:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&R,&C);
     ^
./Main.c:42:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&sy,&sx);
     ^
./Main.c:43:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&gy,&gx);
     ^
./Main.c:46:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",c[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 128 KB
subtask0_sample02.txt AC 1 ms 128 KB
subtask0_sample03.txt AC 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 128 KB
subtask1_04.txt AC 1 ms 128 KB
subtask1_05.txt AC 1 ms 128 KB
subtask1_06.txt AC 1 ms 128 KB
subtask1_07.txt AC 1 ms 128 KB
subtask1_08.txt AC 1 ms 128 KB
subtask1_09.txt AC 1 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 1 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 1 ms 128 KB
subtask1_16.txt AC 1 ms 128 KB
subtask1_17.txt AC 1 ms 128 KB
subtask1_18.txt AC 1 ms 128 KB
subtask1_19.txt AC 1 ms 128 KB
subtask1_20.txt AC 1 ms 128 KB
subtask1_21.txt AC 1 ms 128 KB
subtask1_22.txt AC 1 ms 128 KB