Submission #1178266

---

Source Code Expand

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <stdlib.h>
#include <stdbool.h>
#define MOD 1000000007
void input_array(int how_data,int *data);
void input_array2(int first , int second , char data[][60]);
int get_random(int min, int max);
int factorial(int n);
int fibonacci(int n);
int qsort_09(const int *sys1 , const int *sys2);
int qsort_90(const int *sys1 , const int *sys2);
int sel_max(int a , int b);
int sel_min(int a , int b);
int array_max(int how_data,int *data);
int array_min(int how_data,int *data);
int can_DP(int how_data,int *data,int how_can,bool *can);
int array_sum(int how_data,int *data);
int loop1,loop2,loop3,loop4,loop5,i_temp;
char c_temp;

int main(void){
    int how_y,how_x;
    int start_y,start_x;
    int goal_y,goal_x;
    char map[60][60]={{'\0'}};
    int tansaku[60][60];
    for(loop1=0;loop1<60;loop1++){
        for(loop2=0;loop2<60;loop2++){
            tansaku[loop1][loop2]=-1;
        }
    }
    scanf("%d %d",&how_y,&how_x);
    scanf("%d %d",&start_y,&start_x);
    scanf("%d %d\n",&goal_y,&goal_x);
    //printf("input\n");
    input_array2(how_y,how_x,map);
    //return 0;
    //01そろえ
    start_y-=1;
    start_x-=1;
    goal_y-=1;
    goal_x-=1;
    tansaku[start_y][start_x]=0;
    while(tansaku[goal_y][goal_x]==-1){
        //printf("START\n");
        for(loop1=0;loop1<how_y;loop1++){
            for(loop2=0;loop2<how_x;loop2++){
                if(tansaku[loop1][loop2]!=-1){
                    //printf("%d %d\n",loop1,loop2);
                    //printf("%c",map[loop1+1][loop2]);
                    if(map[loop1-1][loop2]=='.'&&tansaku[loop1-1][loop2]==-1){
                        tansaku[loop1-1][loop2]=tansaku[loop1][loop2]+1;
                        //printf("ue\n");
                    }
                    if(map[loop1+1][loop2]=='.'&&tansaku[loop1+1][loop2]==-1){
                        tansaku[loop1+1][loop2]=tansaku[loop1][loop2]+1;
                        //printf("sita\n");
                    }
                    if(map[loop1][loop2-1]=='.'&&tansaku[loop1][loop2-1]==-1){
                        tansaku[loop1][loop2-1]=tansaku[loop1][loop2]+1;
                        //printf("hidari\n");
                    }
                    if(map[loop1][loop2+1]=='.'&&tansaku[loop1][loop2+1]==-1){
                        tansaku[loop1][loop2+1]=tansaku[loop1][loop2]+1;
                        //printf("migi\n");
                    }
                }
            }
        }
    }
    printf("%d\n",tansaku[goal_y][goal_x]);
    return 0;
    
}


//how_data個の配列data[]に標準入力
//input_array(how_data,data);
void input_array(int how_data,int *data){
    int loop;
    for(loop=0;loop<how_data;loop++){
        scanf("%d",&data[loop]);
    }
    return ;
}

void input_array2(int first,int second,char data[][60]){
    int loopA,loopB;
    for(loopA=0;loopA<first;loopA++){
        for(loopB=0;loopB<second;loopB++){
            scanf("%c",&data[loopA][loopB]);
            //printf("%c",data[loopA][loopB]);
        }
        scanf("\n");
        //printf("\n");
    }
    return ;
}

int get_random(int min, int max){   //指定の範囲から乱数を1つ返すやつ
    //srand((unsigned int)time(0));   //現在時刻で疑似乱数初期化
    rand();rand();rand();rand();    //乱数を空打ち
    return (rand()%(max+1-min))+min;
}


int factorial(int n){//n!のMOD10^9+7を返すやつ
    unsigned long long int ret=1;
    for(int i=1;i<=n;i++)ret=(ret*i)%1000000007;
    return (int)ret;
}

int qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ
    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_09);
    if(*sys1<*sys2){
        return -1;
    }else if(*sys1==*sys2){
        return 0;
    }else{
        return 1;
    }
}

int qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ
    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_90);
    if(*sys1<*sys2){
        return 1;
    }else if(*sys1==*sys2){
        return 0;
    }else{
        return -1;
    }
}

int fibonacci(int n){
    switch(n){
        case 0:return 0;
        case 1:return 1;
        default :return fibonacci(n-1)+fibonacci(n-2);
    }
}

int sel_max(int a,int b){
    if(a>b)return a;
    return b;
}

int sel_min(int a,int b){
    if(a>b)return b;
    return a;
}

int can_DP(int how_data,int *data,int how_can,bool *can){//Typical DP Contest A
    //data内で組み合わせられる和をcanに0 or 1で入れる
    //返り値はパターン数
    int loopA,loopB;
    int ret=0;
    for(loopA=0;loopA<how_can;loopA++){//初期化
        can[loopA]=0;
    }
    can[0]=1;//絶対にありえる
    for(loopA=0;loopA<how_data;loopA++){
        for(loopB=how_can-1;loopB>=0;loopB--){
            if(can[loopB]==1 && loopB+data[loopA]<how_can){
                can[loopB+data[loopA]]=1;
            }
        }
    }
    for(loopA=0;loopA<how_can;loopA++){
        if(can[loopA]==1){
            ret++;
        }
    }
    return ret;
}
int array_max(int how_data,int *data){
    int loop;
    int ret=data[0];
    for(loop=0;loop<how_data;loop++){
        if(ret<data[loop])ret=data[loop];
    }
    return ret;
}
int array_min(int how_data,int *data){
    int loop;
    int ret=data[0];
    for(loop=0;loop<how_data;loop++){
        if(ret>data[loop])ret=data[loop];
    }
    return ret;
}
int array_sum(int how_data,int *data){
    int ret=0;
    int loop;
    for(loop=0;loop<how_data;loop++){
        ret+=data[loop];
    }
    return ret;
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:35:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&how_y,&how_x);
     ^
./Main.c:36:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&start_y,&start_x);
     ^
./Main.c:37:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d\n",&goal_y,&goal_x);
     ^
./Main.c: In function ‘input_array’:
./Main.c:85:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&data[loop]);
         ^
./Main.c: In function ‘input_array2’:
./Main.c:94:13: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c",&data[loopA][loopB]);
             ^
./Main.c:97:9: warning: ignoring return value of ‘scanf’, declared with attrib...

Judge Result