Submission #3792208


Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <queue>
#define INF 114514
using namespace std;
typedef pair<int, int> P;
int m, n, sy, sx, gy, gx, memo[64][64], dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
char c[64][64];
queue<P> que;
void end() {
	system("PAUSE");
	return;
}
signed main() {
	cin >> m >> n >> sy >> sx >> gy >> gx;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			cin >> c[j][i];
			memo[j][i] = INF;
		}
	}
	que.push(P(sx, sy));
	memo[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 < n && 0 <= ny && ny < m&&c[nx][ny] != '#'&&memo[nx][ny] == INF) {
				que.push(P(nx, ny));
				memo[nx][ny] = memo[p.first][p.second] + 1;
			}
		}
	}
	cout << memo[gx][gy]<<endl;
	end();
}

Submission Info

Submission Time
Task C - 幅優先探索
User Osmium_1008
Language C++14 (GCC 5.4.1)
Score 0
Code Size 971 Byte
Status WA
Exec Time 2 ms
Memory 504 KB

Compile Error

./Main.cpp: In function ‘void end()’:
./Main.cpp:14:17: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
  system("PAUSE");
                 ^

Judge Result

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