Submission #6899062


Source Code Expand

Copy
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
char ch;
int mp[501][501];
int n,m,step,x,y,ans;
int dx[5] = {0,1,-1,0,0};
int dy[5] = {0,0,0,1,-1};
int dfs(int x,int y,int step)
{
	if(mp[x][y] == 2)
	{
		//printf("Yes");
		return 1;
	}
	if(step > m + n)
	{
		//printf("No");
		return 0;
	}
	for(int i=1;i<=4;i++)
	{
		int nx = x + dx[i];
		int ny = y + dy[i];
		if(nx >= 1 && nx <=n && ny >= 1 && ny <= m && mp[nx][ny] != 0)
		dfs(nx,ny,step+1);
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	{
		cin>>ch;
		if(ch == 's')
		x = i;
		y = j;
		if(ch == 'g')
		mp[i][j] == 2;
		if(ch == '.')
		mp[i][j] == 1;
		if(ch == '#')
		mp[i][j] == 0;
	}
	int gg = dfs(x,y,0);
	if(gg == 1)
	printf("Yes");
	else
	printf("No");
	//printf("%d",);
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 867 Byte
Status
Exec Time 15 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^

Judge Result

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