Submission #691262


Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
 
using namespace std;
 
#define pai 3.14159265359
#define mod 1000000007

int main()
{
    int r, c, sx, sy, gx, gy;
    cin >> r >> c >> sx >> sy >> gx >> gy;
    char meiro[51][51];
    int tesu[51][51];
    for(int i = 1; i < r + 1; i++){
        for(int j = 1; j < c + 1; j++){
            cin >> meiro[i][j];
            tesu[i][j] = -1;
        }
    }
    tesu[sx][sy] = 0;
    int dx[4] = {1, 0, -1, 0};
    int dy[4] = {0, 1, 0, -1};
    queue<int> xqu;
    queue<int> yqu;
    xqu.push(sx);
    yqu.push(sy);
    while(!xqu.empty()){
        int x = xqu.front();
        int y = yqu.front();
        xqu.pop();
        yqu.pop();
        if(x == gx && y == gy) break;
        for(int i = 0; i < 4; i++){
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(nx < 1 || nx > r || ny < 1 || ny > c || tesu[nx][ny] != -1 || meiro[nx][ny] == '#') continue;
            tesu[nx][ny] = tesu[x][y] + 1;
            xqu.push(nx);
            yqu.push(ny);
        }
    }
    cout << tesu[gx][gy] << endl;
    return 0;
}

Submission Info

Submission Time
Task A - 幅優先探索
User maple
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1418 Byte
Status AC
Exec Time 5 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 4 ms 256 KB
subtask0_sample02.txt AC 4 ms 256 KB
subtask0_sample03.txt AC 5 ms 256 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 5 ms 256 KB
subtask1_03.txt AC 5 ms 256 KB
subtask1_04.txt AC 5 ms 256 KB
subtask1_05.txt AC 4 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 4 ms 256 KB
subtask1_09.txt AC 4 ms 256 KB
subtask1_10.txt AC 5 ms 256 KB
subtask1_11.txt AC 4 ms 256 KB
subtask1_12.txt AC 4 ms 256 KB
subtask1_13.txt AC 5 ms 256 KB
subtask1_14.txt AC 4 ms 256 KB
subtask1_15.txt AC 5 ms 256 KB
subtask1_16.txt AC 4 ms 256 KB
subtask1_17.txt AC 4 ms 256 KB
subtask1_18.txt AC 4 ms 256 KB
subtask1_19.txt AC 4 ms 256 KB
subtask1_20.txt AC 4 ms 256 KB
subtask1_21.txt AC 4 ms 256 KB
subtask1_22.txt AC 4 ms 256 KB