Submission #7370080


Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	long long x,y,s;
}que[2501];
long long n,m,a[501][501],book[501][501];
long long x1,y1,x2,y2,tx,ty;
char s[501][501];

int main(){
	long long next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
			if(s[i][j]=='s'){
				a[i][j]=0;
				x1=i;
				y1=j;
			}
			else if(s[i][j]=='#'){
				a[i][j]=1;
			}
			else if(s[i][j]=='g'){
				a[i][j]=0;
				x2=i;
				y2=j;
			}
			else{
				a[i][j]=0; 
			}
		}
	}
	long long head=1,tail=1;
	long long f=0;
	que[tail].x=x1;
	que[tail].y=y1;
	tail++;
	book[x1][y1]=1;
	while(head<tail){
		for(int k=0;k<=3;k++){
			tx=que[head].x+next[k][0];
			ty=que[head].y+next[k][1];
			if(tx<1||tx>n||ty<1||ty>m) continue;
			if(a[tx][ty]==0&&book[tx][ty]==0){
				book[tx][ty]=1;
				que[tail].x=tx;
				que[tail].y=ty;
				tail++;
			}
			if(tx==x2&&ty==y2){
				cout<<"Yes\n";
				return 0;
			}
		}
		head++;
	}
	cout<<"No\n";
	return 0;
	
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 0
Code Size 1073 Byte
Status RE
Exec Time 116 ms
Memory 3200 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 5
AC × 58
RE × 25
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 2 ms 2304 KB
00_min_02.txt AC 2 ms 2304 KB
00_min_03.txt AC 2 ms 2304 KB
00_min_04.txt AC 2 ms 2304 KB
00_min_05.txt AC 2 ms 2304 KB
00_min_06.txt AC 2 ms 2304 KB
00_min_07.txt AC 2 ms 2304 KB
00_min_08.txt AC 2 ms 2304 KB
00_sample_01.txt AC 2 ms 2304 KB
00_sample_02.txt AC 2 ms 2304 KB
00_sample_03.txt AC 2 ms 2304 KB
00_sample_04.txt AC 2 ms 2304 KB
00_sample_05.txt AC 2 ms 2304 KB
01_rnd_00.txt AC 15 ms 2560 KB
01_rnd_01.txt RE 115 ms 2944 KB
01_rnd_02.txt RE 115 ms 2688 KB
01_rnd_03.txt RE 112 ms 2944 KB
01_rnd_04.txt RE 113 ms 2944 KB
01_rnd_05.txt AC 17 ms 2688 KB
01_rnd_06.txt RE 115 ms 2944 KB
01_rnd_07.txt RE 115 ms 3072 KB
01_rnd_08.txt AC 15 ms 2560 KB
01_rnd_09.txt AC 16 ms 2688 KB
01_rnd_10.txt RE 113 ms 3072 KB
01_rnd_11.txt AC 17 ms 2560 KB
01_rnd_12.txt RE 113 ms 2944 KB
01_rnd_13.txt RE 113 ms 2944 KB
01_rnd_14.txt AC 16 ms 2688 KB
01_rnd_15.txt RE 114 ms 2944 KB
01_rnd_16.txt AC 15 ms 2560 KB
01_rnd_17.txt RE 113 ms 3072 KB
01_rnd_18.txt AC 16 ms 2560 KB
01_rnd_19.txt RE 112 ms 3072 KB
02_rndhard_00.txt AC 16 ms 2816 KB
02_rndhard_01.txt AC 16 ms 2816 KB
02_rndhard_02.txt RE 113 ms 2944 KB
02_rndhard_03.txt RE 113 ms 2944 KB
02_rndhard_04.txt AC 16 ms 2688 KB
02_rndhard_05.txt AC 16 ms 2688 KB
02_rndhard_06.txt AC 17 ms 2816 KB
02_rndhard_07.txt AC 16 ms 2688 KB
02_rndhard_08.txt RE 113 ms 3072 KB
02_rndhard_09.txt RE 114 ms 3072 KB
02_rndhard_10.txt RE 115 ms 3200 KB
02_rndhard_11.txt RE 114 ms 3200 KB
02_rndhard_12.txt RE 113 ms 3072 KB
02_rndhard_13.txt RE 115 ms 3072 KB
02_rndhard_14.txt RE 113 ms 3200 KB
02_rndhard_15.txt RE 114 ms 3200 KB
02_rndhard_16.txt AC 16 ms 2816 KB
02_rndhard_17.txt AC 16 ms 2816 KB
02_rndhard_18.txt AC 17 ms 2944 KB
02_rndhard_19.txt AC 16 ms 2816 KB
02_rndhard_20.txt AC 16 ms 2816 KB
02_rndhard_21.txt AC 16 ms 2816 KB
02_rndhard_22.txt RE 113 ms 3200 KB
02_rndhard_23.txt AC 17 ms 3072 KB
02_rndhard_24.txt AC 16 ms 2688 KB
02_rndhard_25.txt AC 16 ms 2688 KB
02_rndhard_26.txt AC 17 ms 2944 KB
02_rndhard_27.txt AC 16 ms 2688 KB
02_rndhard_28.txt AC 16 ms 2944 KB
02_rndhard_29.txt AC 16 ms 2944 KB
02_rndhard_30.txt AC 16 ms 2688 KB
02_rndhard_31.txt AC 18 ms 2688 KB
02_rndhard_32.txt RE 114 ms 3072 KB
02_rndhard_33.txt RE 116 ms 3072 KB
02_rndhard_34.txt AC 16 ms 2816 KB
02_rndhard_35.txt AC 17 ms 2816 KB
02_rndhard_36.txt AC 16 ms 2816 KB
02_rndhard_37.txt AC 16 ms 2688 KB
02_rndhard_38.txt AC 16 ms 2944 KB
02_rndhard_39.txt AC 18 ms 2944 KB
03_rndhardsmall_00.txt AC 2 ms 2304 KB
03_rndhardsmall_01.txt AC 2 ms 2304 KB
03_rndhardsmall_02.txt AC 2 ms 2304 KB
03_rndhardsmall_03.txt AC 2 ms 2304 KB
03_rndhardsmall_04.txt AC 2 ms 2304 KB
03_rndhardsmall_05.txt AC 2 ms 2304 KB
03_rndhardsmall_06.txt AC 2 ms 2304 KB
03_rndhardsmall_07.txt AC 2 ms 2304 KB
03_rndhardsmall_08.txt AC 2 ms 2304 KB
03_rndhardsmall_09.txt AC 2 ms 2304 KB