Submission #691669


Source Code Expand

#include <iostream>
#include <queue>
#include <utility>

using namespace std;
const int INF = 100000000;
const int MAX_R = 51;
const int MAX_C = 51;

typedef pair<int, int> P;

int R, C, sx, sy, gx, gy;
char maze[MAX_R][MAX_C];
int d[MAX_R][MAX_C];

int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int bfs(){
	queue<P> que;
	for(int i = 0; i < R; i++)
		for(int j = 0; j < C; j++) d[i][j] = INF;

	que.push(P(sx, sy));
	d[sx][sy] = 0;

	while(que.size()) {
		P p = que.front(); que.pop();
		if(p.first == gx && p.second == gy) break;

		for(int i = 0; i < 4; i++) {
			int nx = p.first + dx[i], ny = p.second + dy[i];
			if(0 <= nx && nx < R && 0 <= ny && ny < C && maze[nx][ny] != '#' && d[nx][ny] == INF) {
				que.push(P(nx, ny));
				d[nx][ny] = d[p.first][p.second] + 1;
				// printf("x = %d, y = %d, d[x][y] = %d\n", nx, ny, d[nx][ny]);
			}
		}
	}
	return d[gx][gy];
}


int main(){
	cin >> R >> C >> sx >> sy >> gx >> gy;
	sx--; sy--; gx--; gy--;
	for(int i = 0; i < R; i++) 
		scanf("%s", maze[i]);
	cout << bfs() << endl;
	return 0;
}

Submission Info

Submission Time
Task A - 幅優先探索
User mon10
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1099 Byte
Status AC
Exec Time 4 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", maze[i]);
                       ^

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 4 ms 256 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 4 ms 256 KB
subtask1_04.txt AC 4 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 4 ms 256 KB
subtask1_11.txt AC 4 ms 256 KB
subtask1_12.txt AC 4 ms 256 KB
subtask1_13.txt AC 4 ms 256 KB
subtask1_14.txt AC 4 ms 256 KB
subtask1_15.txt AC 4 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