Submission #164488


Source Code Expand

#include <queue>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
    int n, m, sr, sc, gr, gc;
    cin>>n>>m>>sr>>sc>>gr>>gc;
    vector<string> Map(n);
    for(auto& v: Map) cin>>v;

    queue<pair<int, int>> q;
    vector<vector<int>> v(n, vector<int>(m));
    int dr[4]={-1, 0, 1, 0};
    int dc[4]={0, -1, 0, 1};

    sr--, sc--, gr--, gc--;
    q.push(make_pair(sr, sc));
    v[sr][sc]=1;
    pair<int, int> goal=make_pair(gr, gc);
    while (!q.empty()) {
        auto p=q.front(); q.pop();
        if (p==goal) break;

        for(int i=0;i<4;++i) {
            int r=p.first+dr[i];
            int c=p.second+dc[i];
            if (r<0 or r>=n or c<0 or c>=m) continue;
            if (Map[r][c]=='#') continue;
            if (v[r][c]) continue;
            q.push(make_pair(r, c));
            v[r][c]=v[p.first][p.second]+1;
        }
    }
    cout<<v[gr][gc]-1<<endl;
}

Submission Info

Submission Time
Task C - 幅優先探索
User hogeover30
Language C++11 (GCC 4.8.1)
Score 100
Code Size 967 Byte
Status AC
Exec Time 32 ms
Memory 1176 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 31 ms 1036 KB
subtask0_sample02.txt AC 28 ms 1040 KB
subtask0_sample03.txt AC 31 ms 1164 KB
subtask1_01.txt AC 30 ms 1160 KB
subtask1_02.txt AC 30 ms 1152 KB
subtask1_03.txt AC 31 ms 1168 KB
subtask1_04.txt AC 29 ms 1164 KB
subtask1_05.txt AC 29 ms 1172 KB
subtask1_06.txt AC 29 ms 1176 KB
subtask1_07.txt AC 28 ms 996 KB
subtask1_08.txt AC 28 ms 1164 KB
subtask1_09.txt AC 31 ms 1160 KB
subtask1_10.txt AC 29 ms 1164 KB
subtask1_11.txt AC 30 ms 1164 KB
subtask1_12.txt AC 28 ms 1000 KB
subtask1_13.txt AC 28 ms 1164 KB
subtask1_14.txt AC 31 ms 1164 KB
subtask1_15.txt AC 30 ms 1164 KB
subtask1_16.txt AC 30 ms 1172 KB
subtask1_17.txt AC 29 ms 1168 KB
subtask1_18.txt AC 29 ms 996 KB
subtask1_19.txt AC 30 ms 1176 KB
subtask1_20.txt AC 29 ms 1000 KB
subtask1_21.txt AC 32 ms 1176 KB
subtask1_22.txt AC 28 ms 1000 KB