Submission #3571783


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int n,m;
bool f=true;
bool mapp[501][501];
int sx,sy,ex,ey;
const int goxx[5]={0,0,1,0,-1};
const int goyy[5]={0,1,0,-1,0};
int dfss(int,int);
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	{
		char c[501];
		scanf("%s",c);
		for (int j=0;j<m;j++)
		{
			if (c[j]=='s')
			{
				sx=i;
				sy=j+1;
				//mapp[i][j+1]=true;
			}
			if (c[j]=='.') mapp[i][j+1]=true;
			if (c[j]=='#') mapp[i][j+1]=false;
			if (c[j]=='g')
			{
				ex=i;
				ey=j+1;
				mapp[i][j+1]=true;
			}
		}
	}
	/*for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=m;j++)
			cout<<mapp[i][j]<<' ';
		cout<<endl;
	}*/
	dfss(sx,sy);
	if (!mapp[ex][ey]) cout<<"Yes"<<endl;else cout<<"No"<<endl;
	/*for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=m;j++)
			cout<<mapp[i][j]<<' ';
		cout<<endl;
	}*/
	return 0;
}
int dfss(int x,int y)
{
	for (int i=1;i<=4;i++)
	{
		int xx=x+goxx[i];
		int yy=y+goyy[i];
		if ((xx>0)&&(xx<=n)&&(yy>0)&&(yy<=m)&&(mapp[xx][yy]))
		{
			mapp[xx][yy]=false;
			dfss(xx,yy);
			//mapp[xx][yy]=true;
		}
	}
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 100
Code Size 1111 Byte
Status AC
Exec Time 11 ms
Memory 11776 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 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 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 2 ms 512 KB
01_rnd_01.txt AC 11 ms 9600 KB
01_rnd_02.txt AC 9 ms 4096 KB
01_rnd_03.txt AC 11 ms 11776 KB
01_rnd_04.txt AC 11 ms 9088 KB
01_rnd_05.txt AC 3 ms 512 KB
01_rnd_06.txt AC 8 ms 2816 KB
01_rnd_07.txt AC 9 ms 4480 KB
01_rnd_08.txt AC 2 ms 512 KB
01_rnd_09.txt AC 3 ms 512 KB
01_rnd_10.txt AC 6 ms 896 KB
01_rnd_11.txt AC 2 ms 512 KB
01_rnd_12.txt AC 10 ms 7040 KB
01_rnd_13.txt AC 10 ms 6912 KB
01_rnd_14.txt AC 3 ms 512 KB
01_rnd_15.txt AC 7 ms 1920 KB
01_rnd_16.txt AC 2 ms 512 KB
01_rnd_17.txt AC 7 ms 1536 KB
01_rnd_18.txt AC 2 ms 512 KB
01_rnd_19.txt AC 11 ms 11264 KB
02_rndhard_00.txt AC 3 ms 512 KB
02_rndhard_01.txt AC 3 ms 512 KB
02_rndhard_02.txt AC 4 ms 640 KB
02_rndhard_03.txt AC 4 ms 512 KB
02_rndhard_04.txt AC 3 ms 512 KB
02_rndhard_05.txt AC 3 ms 512 KB
02_rndhard_06.txt AC 3 ms 512 KB
02_rndhard_07.txt AC 3 ms 512 KB
02_rndhard_08.txt AC 3 ms 512 KB
02_rndhard_09.txt AC 3 ms 512 KB
02_rndhard_10.txt AC 3 ms 512 KB
02_rndhard_11.txt AC 3 ms 512 KB
02_rndhard_12.txt AC 3 ms 512 KB
02_rndhard_13.txt AC 3 ms 512 KB
02_rndhard_14.txt AC 3 ms 512 KB
02_rndhard_15.txt AC 3 ms 512 KB
02_rndhard_16.txt AC 3 ms 512 KB
02_rndhard_17.txt AC 3 ms 512 KB
02_rndhard_18.txt AC 3 ms 512 KB
02_rndhard_19.txt AC 3 ms 512 KB
02_rndhard_20.txt AC 3 ms 512 KB
02_rndhard_21.txt AC 3 ms 512 KB
02_rndhard_22.txt AC 3 ms 512 KB
02_rndhard_23.txt AC 3 ms 512 KB
02_rndhard_24.txt AC 3 ms 512 KB
02_rndhard_25.txt AC 3 ms 512 KB
02_rndhard_26.txt AC 3 ms 512 KB
02_rndhard_27.txt AC 3 ms 512 KB
02_rndhard_28.txt AC 3 ms 512 KB
02_rndhard_29.txt AC 3 ms 512 KB
02_rndhard_30.txt AC 3 ms 512 KB
02_rndhard_31.txt AC 3 ms 512 KB
02_rndhard_32.txt AC 3 ms 512 KB
02_rndhard_33.txt AC 3 ms 512 KB
02_rndhard_34.txt AC 3 ms 512 KB
02_rndhard_35.txt AC 3 ms 512 KB
02_rndhard_36.txt AC 3 ms 512 KB
02_rndhard_37.txt AC 3 ms 512 KB
02_rndhard_38.txt AC 3 ms 512 KB
02_rndhard_39.txt AC 3 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 1 ms 256 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