Submission #1691601


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef pair<int,int> int_pair;
typedef long long ll;
const int R=50;
const int C=50;


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int r,c,sy,sx,gy,gx;
	char ci[R][C];
	int saisyo[R][C];
	CLR(saisyo);
	int xx[]={1,-1,0,0};
	int yy[]={0,0,1,-1};

	cin >> r >> c;
	cin >> sy >> sx >> gy >> gx;
	--sy;--sx;--gy;--gx;
	FOR(i,0,r)
		FOR(j,0,c)
			cin >> ci[i][j];

	queue <int_pair> q;
	//    <  y , x >
	q.push(pair<int,int>(sy,sx));

	while(1){
		if(q.size()==0)break;
		int_pair p = q.front();
		int x = p.second;
		int y = p.first;
		q.pop();
		FOR(i,0,4){
			if(ci[ y+yy[i] ][ x+xx[i]]=='.' && saisyo[ y+yy[i] ][ x+xx[i]]==0){
				saisyo[ y+yy[i] ][ x+xx[i]] = saisyo[y][x] + 1;
				q.push(pair<int,int>(y+yy[i],x+xx[i]));
			}
		}
	}
	cout << saisyo[gy][gx] << endl;

	return 0;
}

Submission Info

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