Submission #3489419


Source Code Expand

#include<iostream>
#include<cstdio>
using namespace std;
int h[250005][3];
bool vis[504][504];
int a[]={1,0,-1,0};
int b[]={0,1,0,-1};
int f=0,l=0;
int main()
{
	char s[504][504];
	int n,m;
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++)
	{
		for(int j=1;j<=n;j++)
		cin>>s[i][j];	
	}
	for(int q=1;q<=m;q++)
	{
		for(int w=1;w<=n;w++)
		{
			if(s[q][w]=='s')
			{
				h[0][1]=q,h[0][2]=w,vis[q][w]=1;
				int head=0,tail=0;
				do
				{
					
					for(int p=0;p<4;p++)
					{
						if(h[tail][1]+a[p]>=1&&h[tail][1]+a[p]<=m&&h[tail][2]+b[p]>=1&&h[tail][2]+b[p]<=n){
						if(s[h[tail][1]+a[p]][h[tail][2]+b[p]]=='g')
						{
							cout<<"Yes"<<endl;
							return 0;
						}
						if(!vis[h[tail][1]+a[p]][h[tail][2]+b[p]]&&s[h[tail][1]+a[p]][h[tail][2]+b[p]]=='.')
						{
							vis[h[tail][1]+a[p]][h[tail][2]+b[p]]=1;
							h[head+1][1]=h[tail][1]+a[p];
							h[head+1][2]=h[tail][2]+b[p];
							f=1;head++;
							//cout<<h[head][1]<<" "<<h[head][2]<<endl;
						}}
					}
					tail++;
					f=0;
					
				}while(head>=tail);
				l=1;
				break;
			}
			
		}if(l)break;
	}
	cout<<"No"<<endl;
	return 0;
}

Submission Info

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

Compile Error

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

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 14 ms 512 KB
01_rnd_01.txt AC 15 ms 896 KB
01_rnd_02.txt AC 17 ms 1408 KB
01_rnd_03.txt AC 18 ms 2688 KB
01_rnd_04.txt AC 17 ms 1664 KB
01_rnd_05.txt AC 15 ms 512 KB
01_rnd_06.txt AC 18 ms 2048 KB
01_rnd_07.txt AC 18 ms 1920 KB
01_rnd_08.txt AC 14 ms 512 KB
01_rnd_09.txt AC 15 ms 512 KB
01_rnd_10.txt AC 18 ms 2048 KB
01_rnd_11.txt AC 15 ms 512 KB
01_rnd_12.txt AC 19 ms 2560 KB
01_rnd_13.txt AC 15 ms 512 KB
01_rnd_14.txt AC 15 ms 512 KB
01_rnd_15.txt AC 18 ms 1792 KB
01_rnd_16.txt AC 15 ms 512 KB
01_rnd_17.txt AC 19 ms 2304 KB
01_rnd_18.txt AC 15 ms 512 KB
01_rnd_19.txt AC 16 ms 1536 KB
02_rndhard_00.txt AC 15 ms 512 KB
02_rndhard_01.txt AC 15 ms 512 KB
02_rndhard_02.txt AC 15 ms 896 KB
02_rndhard_03.txt AC 15 ms 896 KB
02_rndhard_04.txt AC 14 ms 512 KB
02_rndhard_05.txt AC 15 ms 512 KB
02_rndhard_06.txt AC 15 ms 512 KB
02_rndhard_07.txt AC 15 ms 512 KB
02_rndhard_08.txt AC 15 ms 640 KB
02_rndhard_09.txt AC 15 ms 640 KB
02_rndhard_10.txt AC 15 ms 640 KB
02_rndhard_11.txt AC 15 ms 640 KB
02_rndhard_12.txt AC 15 ms 640 KB
02_rndhard_13.txt AC 15 ms 640 KB
02_rndhard_14.txt AC 15 ms 640 KB
02_rndhard_15.txt AC 15 ms 640 KB
02_rndhard_16.txt AC 14 ms 512 KB
02_rndhard_17.txt AC 15 ms 512 KB
02_rndhard_18.txt AC 14 ms 512 KB
02_rndhard_19.txt AC 15 ms 512 KB
02_rndhard_20.txt AC 15 ms 512 KB
02_rndhard_21.txt AC 15 ms 512 KB
02_rndhard_22.txt AC 15 ms 640 KB
02_rndhard_23.txt AC 15 ms 640 KB
02_rndhard_24.txt AC 15 ms 512 KB
02_rndhard_25.txt AC 16 ms 512 KB
02_rndhard_26.txt AC 15 ms 512 KB
02_rndhard_27.txt AC 15 ms 512 KB
02_rndhard_28.txt AC 15 ms 512 KB
02_rndhard_29.txt AC 15 ms 512 KB
02_rndhard_30.txt AC 15 ms 512 KB
02_rndhard_31.txt AC 15 ms 512 KB
02_rndhard_32.txt AC 15 ms 640 KB
02_rndhard_33.txt AC 15 ms 640 KB
02_rndhard_34.txt AC 15 ms 512 KB
02_rndhard_35.txt AC 15 ms 512 KB
02_rndhard_36.txt AC 15 ms 512 KB
02_rndhard_37.txt AC 15 ms 512 KB
02_rndhard_38.txt AC 15 ms 512 KB
02_rndhard_39.txt AC 15 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