AtCoder Typical Contest 001

Submission #10101377

Source codeソースコード

#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
char a [505][505];
int b [505][505];
using namespace std;
struct node
{
	int a;
	int b;
};
deque<node> q;
int n, m;
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> a[i][j];
		}
	}
	int i, j;
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= m; j++)
		{
			if (a[i][j] == 's')
			{
				b[i][j] = 1;
				break;
			}
		}
		if (b[i][j] == 1)
			break;
	}
	q.push_back({ i,j });
	while (!q.empty())
	{
		node z = q.front();
		q.pop_front();
		if (a[z.a][z.b] == 'g')
		{
			cout << "Yes";
			return 0;
		}
		else
		{
			if (z.b - 1 >= 1 && a[z.a][z.b - 1] != '#' && !b[z.a][z.b - 1])
			{
				q.push_back({ z.a,z.b - 1 });
				b[z.a][z.b - 1] = 1;
			}
			if (z.b + 1 <= m && a[z.a][z.b + 1] != '#' && !b[z.a][z.b + 1])
			{
				q.push_back({ z.a,z.b + 1 });
				b[z.a][z.b + 1] = 1;
			}
			if (z.a - 1 >= 1 && a[z.a - 1][z.b] != '#' && !b[z.a - 1][z.b])
			{
				q.push_back({ z.a - 1,z.b});
				b[z.a - 1][z.b] = 1;
			}
			if (z.a + 1 <= n && a[z.a + 1][z.b] != '#' && !b[z.a + 1][z.b])
			{
				q.push_back({ z.a + 1,z.b });
				b[z.a + 1][z.b] = 1;
			}
		}
	}
	cout << "NO";
	return 0;
}

Submission

Task問題 A - 深さ優先探索
User nameユーザ名 luogu_bot5
Created time投稿日時
Language言語 C++ (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1296 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:14: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ i,j });
^
./Main.cpp:39:21: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ i,j });
^
./Main.cpp:53:17: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ z.a,z.b - 1 });
^
./Main.cpp:53:32: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ z.a,z.b - 1 });
^
./Main.cpp:58:17: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ z.a,z.b + 1 });
^
./Main.cpp:58:32: warning: extended initializer lists only available with -std=c++11 or -std=gnu++11
q.push_back({ z.a,z.b + 1 });
^
./Main.cpp:63:17: warning: extended initi...

Test case

Set

Set name Score得点 / Max score Cases
Sample - 00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt
All 0 / 100 00_min_01.txt,00_min_02.txt,00_min_03.txt,00_min_04.txt,00_min_05.txt,00_min_06.txt,00_min_07.txt,00_min_08.txt,00_sample_01.txt,00_sample_02.txt,00_sample_03.txt,00_sample_04.txt,00_sample_05.txt,01_rnd_00.txt,01_rnd_01.txt,01_rnd_02.txt,01_rnd_03.txt,01_rnd_04.txt,01_rnd_05.txt,01_rnd_06.txt,01_rnd_07.txt,01_rnd_08.txt,01_rnd_09.txt,01_rnd_10.txt,01_rnd_11.txt,01_rnd_12.txt,01_rnd_13.txt,01_rnd_14.txt,01_rnd_15.txt,01_rnd_16.txt,01_rnd_17.txt,01_rnd_18.txt,01_rnd_19.txt,02_rndhard_00.txt,02_rndhard_01.txt,02_rndhard_02.txt,02_rndhard_03.txt,02_rndhard_04.txt,02_rndhard_05.txt,02_rndhard_06.txt,02_rndhard_07.txt,02_rndhard_08.txt,02_rndhard_09.txt,02_rndhard_10.txt,02_rndhard_11.txt,02_rndhard_12.txt,02_rndhard_13.txt,02_rndhard_14.txt,02_rndhard_15.txt,02_rndhard_16.txt,02_rndhard_17.txt,02_rndhard_18.txt,02_rndhard_19.txt,02_rndhard_20.txt,02_rndhard_21.txt,02_rndhard_22.txt,02_rndhard_23.txt,02_rndhard_24.txt,02_rndhard_25.txt,02_rndhard_26.txt,02_rndhard_27.txt,02_rndhard_28.txt,02_rndhard_29.txt,02_rndhard_30.txt,02_rndhard_31.txt,02_rndhard_32.txt,02_rndhard_33.txt,02_rndhard_34.txt,02_rndhard_35.txt,02_rndhard_36.txt,02_rndhard_37.txt,02_rndhard_38.txt,02_rndhard_39.txt,03_rndhardsmall_00.txt,03_rndhardsmall_01.txt,03_rndhardsmall_02.txt,03_rndhardsmall_03.txt,03_rndhardsmall_04.txt,03_rndhardsmall_05.txt,03_rndhardsmall_06.txt,03_rndhardsmall_07.txt,03_rndhardsmall_08.txt,03_rndhardsmall_09.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_min_01.txt AC 1 ms 256 KB
00_min_02.txt WA
00_min_03.txt WA
00_min_04.txt WA
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt WA
00_min_07.txt WA
00_min_08.txt WA
00_sample_01.txt WA
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt WA
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt WA
01_rnd_00.txt WA
01_rnd_01.txt AC 15 ms 896 KB
01_rnd_02.txt AC 17 ms 1152 KB
01_rnd_03.txt AC 17 ms 1536 KB
01_rnd_04.txt AC 17 ms 1152 KB
01_rnd_05.txt WA
01_rnd_06.txt AC 19 ms 1408 KB
01_rnd_07.txt AC 18 ms 1536 KB
01_rnd_08.txt WA
01_rnd_09.txt WA
01_rnd_10.txt WA
01_rnd_11.txt WA
01_rnd_12.txt AC 19 ms 1536 KB
01_rnd_13.txt AC 15 ms 640 KB
01_rnd_14.txt WA
01_rnd_15.txt AC 18 ms 1408 KB
01_rnd_16.txt WA
01_rnd_17.txt WA
01_rnd_18.txt WA
01_rnd_19.txt AC 16 ms 1280 KB
02_rndhard_00.txt WA
02_rndhard_01.txt WA
02_rndhard_02.txt WA
02_rndhard_03.txt WA
02_rndhard_04.txt WA
02_rndhard_05.txt WA
02_rndhard_06.txt WA
02_rndhard_07.txt WA
02_rndhard_08.txt WA
02_rndhard_09.txt WA
02_rndhard_10.txt WA
02_rndhard_11.txt WA
02_rndhard_12.txt WA
02_rndhard_13.txt WA
02_rndhard_14.txt WA
02_rndhard_15.txt WA
02_rndhard_16.txt WA
02_rndhard_17.txt WA
02_rndhard_18.txt WA
02_rndhard_19.txt WA
02_rndhard_20.txt WA
02_rndhard_21.txt WA
02_rndhard_22.txt WA
02_rndhard_23.txt WA
02_rndhard_24.txt WA
02_rndhard_25.txt WA
02_rndhard_26.txt WA
02_rndhard_27.txt WA
02_rndhard_28.txt WA
02_rndhard_29.txt WA
02_rndhard_30.txt WA
02_rndhard_31.txt WA
02_rndhard_32.txt WA
02_rndhard_33.txt WA
02_rndhard_34.txt WA
02_rndhard_35.txt WA
02_rndhard_36.txt WA
02_rndhard_37.txt WA
02_rndhard_38.txt WA
02_rndhard_39.txt WA
03_rndhardsmall_00.txt WA
03_rndhardsmall_01.txt WA
03_rndhardsmall_02.txt WA
03_rndhardsmall_03.txt WA
03_rndhardsmall_04.txt WA
03_rndhardsmall_05.txt WA
03_rndhardsmall_06.txt WA
03_rndhardsmall_07.txt WA
03_rndhardsmall_08.txt WA
03_rndhardsmall_09.txt WA