AtCoder Typical Contest 001

Submission #1963755

Source codeソースコード

#include "bits/stdc++.h"
using namespace std;
int main()
{
	int h, w;
	scanf("%d %d\n", &h, &w);
	vector<pair<int, int>> mv{make_pair(-1, 0), make_pair(0, -1), make_pair(0, 1), make_pair(1, 0)};
	vector<vector<char>> a(h + 2, vector<char>(w + 2, '#'));
	pair<int, int> s, g;
	for(int i = 1; i <= h; i++)
	{
		for(int j = 1; j <= w; j++)
		{
			scanf("%c", &a[i][j]);
			if(a[i][j] == 's')
			{
				s = make_pair(i, j);
			}
			else if(a[i][j] == 'g')
			{
				g = make_pair(i, j);
			}
		}
		scanf("\n");
	}
	queue<pair<int, int>> q;
	q.push(s);
	for(pair<int, int> t; !q.empty(); )
	{
		t = q.front();
		q.pop();
		if(t == g)
		{
			printf("Yes\n");
			return 0;
		}
		if(a[t.first][t.second] != '#')
		{
			a[t.first][t.second] = '#';
			for(int i = 0; i < 4; i++)
			{
				q.push(make_pair(t.first + mv[i].first, t.second + mv[i].second));
			}
		}
	}
	printf("No\n");
	return 0;
}

Submission

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

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

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d\n", &h, &w);
^
./Main.cpp:14:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%c", &a[i][j]);
^
./Main.cpp:24:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("\n");
^

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 100 / 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 AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 11 ms 512 KB
01_rnd_01.txt AC 12 ms 512 KB
01_rnd_02.txt AC 13 ms 512 KB
01_rnd_03.txt AC 16 ms 512 KB
01_rnd_04.txt AC 14 ms 512 KB
01_rnd_05.txt AC 11 ms 512 KB
01_rnd_06.txt AC 15 ms 512 KB
01_rnd_07.txt AC 15 ms 512 KB
01_rnd_08.txt AC 11 ms 512 KB
01_rnd_09.txt AC 11 ms 512 KB
01_rnd_10.txt AC 15 ms 512 KB
01_rnd_11.txt AC 11 ms 512 KB
01_rnd_12.txt AC 17 ms 512 KB
01_rnd_13.txt AC 11 ms 512 KB
01_rnd_14.txt AC 11 ms 512 KB
01_rnd_15.txt AC 14 ms 512 KB
01_rnd_16.txt AC 11 ms 512 KB
01_rnd_17.txt AC 16 ms 512 KB
01_rnd_18.txt AC 11 ms 512 KB
01_rnd_19.txt AC 13 ms 512 KB
02_rndhard_00.txt AC 11 ms 512 KB
02_rndhard_01.txt AC 11 ms 512 KB
02_rndhard_02.txt AC 12 ms 512 KB
02_rndhard_03.txt AC 12 ms 512 KB
02_rndhard_04.txt AC 11 ms 512 KB
02_rndhard_05.txt AC 11 ms 512 KB
02_rndhard_06.txt AC 11 ms 512 KB
02_rndhard_07.txt AC 11 ms 512 KB
02_rndhard_08.txt AC 11 ms 512 KB
02_rndhard_09.txt AC 11 ms 512 KB
02_rndhard_10.txt AC 11 ms 512 KB
02_rndhard_11.txt AC 11 ms 512 KB
02_rndhard_12.txt AC 11 ms 512 KB
02_rndhard_13.txt AC 11 ms 512 KB
02_rndhard_14.txt AC 11 ms 512 KB
02_rndhard_15.txt AC 11 ms 512 KB
02_rndhard_16.txt AC 11 ms 512 KB
02_rndhard_17.txt AC 11 ms 512 KB
02_rndhard_18.txt AC 11 ms 512 KB
02_rndhard_19.txt AC 11 ms 512 KB
02_rndhard_20.txt AC 11 ms 512 KB
02_rndhard_21.txt AC 11 ms 512 KB
02_rndhard_22.txt AC 11 ms 512 KB
02_rndhard_23.txt AC 11 ms 512 KB
02_rndhard_24.txt AC 11 ms 512 KB
02_rndhard_25.txt AC 11 ms 512 KB
02_rndhard_26.txt AC 11 ms 512 KB
02_rndhard_27.txt AC 11 ms 512 KB
02_rndhard_28.txt AC 11 ms 512 KB
02_rndhard_29.txt AC 11 ms 512 KB
02_rndhard_30.txt AC 11 ms 512 KB
02_rndhard_31.txt AC 11 ms 512 KB
02_rndhard_32.txt AC 11 ms 512 KB
02_rndhard_33.txt AC 11 ms 512 KB
02_rndhard_34.txt AC 11 ms 512 KB
02_rndhard_35.txt AC 11 ms 512 KB
02_rndhard_36.txt AC 11 ms 512 KB
02_rndhard_37.txt AC 11 ms 512 KB
02_rndhard_38.txt AC 11 ms 512 KB
02_rndhard_39.txt AC 11 ms 512 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 2 ms 384 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB