Submission #1624770


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
static const int INF = 2000000000;
static const int NIL = -1;
typedef long long ll;
typedef pair<int,int> P;
//#define int ll 

static const int MAX_N = 51;
static const int MAX_M = 51;

int n,m;
char field[MAX_N][MAX_M];
int f[MAX_N][MAX_M];
int start_y,start_x,goal_y,goal_x;
queue<P> q;
int dy[4]={1,0,-1,0},dx[4]={0,1,0,-1};

int bfs(){
    while(1){
        P tmp = q.front();
        q.pop();
        if(tmp.first==goal_y&&tmp.second==goal_x) return f[tmp.first][tmp.second];
        for(int i=0;i<4;i++){
            int ny = tmp.first + dy[i], nx = tmp.second + dx[i];
            if(0<=ny && ny<n && 0<=nx && nx<m && field[ny][nx]!='#' && f[ny][nx]==INF){
                q.push(P(ny,nx));
                f[ny][nx] = f[tmp.first][tmp.second] + 1;
            }
        }
    }
}

signed main(){
    char tmp;
    scanf("%d %d %d %d %d %d",&n,&m,&start_y,&start_x,&goal_y,&goal_x);

    for(int i=0;i<n;i++){
        for(int k=0;k<m;k++){
            f[i][k] = INF;
        }
    }

    for(int i=0;i<n;i++){
        for(int k=0;k<m;k++){
            cin >> field[i][k];
        }
    }

    f[start_y][start_x] = 0;
    q.push(P(start_y,start_x));

    printf("%d\n",bfs());
}

Submission Info

Submission Time
Task C - 幅優先探索
User r67pr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1285 Byte
Status RE
Exec Time 114 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:71: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d %d %d",&n,&m,&start_y,&start_x,&goal_y,&goal_x);
                                                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 1
RE × 2
AC × 5
WA × 3
RE × 17
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 RE 114 ms 256 KB
subtask0_sample02.txt WA 1 ms 256 KB
subtask0_sample03.txt RE 96 ms 256 KB
subtask1_01.txt RE 96 ms 256 KB
subtask1_02.txt RE 96 ms 256 KB
subtask1_03.txt RE 97 ms 256 KB
subtask1_04.txt RE 96 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt RE 97 ms 256 KB
subtask1_07.txt RE 97 ms 256 KB
subtask1_08.txt RE 97 ms 256 KB
subtask1_09.txt RE 96 ms 256 KB
subtask1_10.txt RE 96 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt RE 96 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt RE 96 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt RE 96 ms 256 KB
subtask1_20.txt RE 96 ms 256 KB
subtask1_21.txt RE 96 ms 256 KB
subtask1_22.txt RE 96 ms 256 KB