Submission #7169544


Source Code Expand

# include <cstdio>
# include <iostream>
# include <algorithm>
using namespace std;
const int N=505;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
int n,m,s1,s2,e1,e2;
int a[N][N];
bool ans,v[N][N];
char c;

void dfs (int i,int j) {
	if (i==e1&&j==e2) {
		ans=1;
		exit(0);
	}
	for (int k=0;k<4;k++) {
		int x=i+dx[k];
		int y=j+dy[k];
		if (x<1||y<1||x>n||y>m||(!a[x][y])||v[x][y]) continue;
		v[x][y]=1;
		dfs (x,y);
		v[x][y]=0;
	}
	return ;
}

int main () {
	scanf ("%d%d",&n,&m);
	for (int i=1;i<=n;i++) {
		for (int j=1;j<=m;j++) {
			cin>>c;
			if (c=='s') {s1=i;s2=j;}
			if (c=='g') {e1=i,e2=j;}
			if (c=='#') a[i][j]=0;
			else a[i][j]=1;
		}
	}v[s1][s2]=1;
	dfs (s1,s2);
	if (ans) puts("Yes");
	else puts("No");
	return 0;
}
//By苍空的蓝耀

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 0
Code Size 811 Byte
Status WA
Exec Time 2107 ms
Memory 7296 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:22: 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 Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
WA × 2
AC × 33
WA × 6
TLE × 44
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 WA 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 WA 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 WA 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt WA 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 18 ms 1280 KB
01_rnd_01.txt WA 1267 ms 3584 KB
01_rnd_02.txt TLE 2103 ms 1280 KB
01_rnd_03.txt WA 19 ms 7296 KB
01_rnd_04.txt TLE 2103 ms 2048 KB
01_rnd_05.txt AC 16 ms 1280 KB
01_rnd_06.txt TLE 2103 ms 1408 KB
01_rnd_07.txt TLE 2103 ms 1408 KB
01_rnd_08.txt AC 16 ms 1280 KB
01_rnd_09.txt AC 16 ms 1280 KB
01_rnd_10.txt TLE 2103 ms 1280 KB
01_rnd_11.txt AC 16 ms 1280 KB
01_rnd_12.txt TLE 2103 ms 1536 KB
01_rnd_13.txt TLE 2103 ms 1792 KB
01_rnd_14.txt AC 16 ms 1280 KB
01_rnd_15.txt TLE 2103 ms 1280 KB
01_rnd_16.txt AC 16 ms 1280 KB
01_rnd_17.txt TLE 2103 ms 1280 KB
01_rnd_18.txt AC 16 ms 1280 KB
01_rnd_19.txt TLE 2104 ms 3968 KB
02_rndhard_00.txt TLE 2103 ms 1280 KB
02_rndhard_01.txt TLE 2103 ms 1280 KB
02_rndhard_02.txt TLE 2103 ms 1280 KB
02_rndhard_03.txt TLE 2103 ms 1280 KB
02_rndhard_04.txt AC 43 ms 1280 KB
02_rndhard_05.txt AC 43 ms 1280 KB
02_rndhard_06.txt TLE 2103 ms 1280 KB
02_rndhard_07.txt AC 18 ms 1280 KB
02_rndhard_08.txt TLE 2103 ms 1280 KB
02_rndhard_09.txt TLE 2103 ms 1280 KB
02_rndhard_10.txt TLE 2103 ms 1280 KB
02_rndhard_11.txt TLE 2103 ms 1280 KB
02_rndhard_12.txt TLE 2103 ms 1280 KB
02_rndhard_13.txt TLE 2103 ms 1280 KB
02_rndhard_14.txt TLE 2103 ms 1280 KB
02_rndhard_15.txt TLE 2103 ms 1280 KB
02_rndhard_16.txt TLE 2103 ms 1280 KB
02_rndhard_17.txt TLE 2103 ms 1280 KB
02_rndhard_18.txt TLE 2103 ms 1280 KB
02_rndhard_19.txt TLE 2103 ms 1280 KB
02_rndhard_20.txt TLE 2103 ms 1280 KB
02_rndhard_21.txt TLE 2103 ms 1280 KB
02_rndhard_22.txt TLE 2107 ms 1280 KB
02_rndhard_23.txt TLE 2103 ms 1280 KB
02_rndhard_24.txt TLE 2103 ms 1280 KB
02_rndhard_25.txt TLE 2103 ms 1280 KB
02_rndhard_26.txt TLE 2103 ms 1280 KB
02_rndhard_27.txt AC 177 ms 1280 KB
02_rndhard_28.txt TLE 2103 ms 1280 KB
02_rndhard_29.txt TLE 2103 ms 1280 KB
02_rndhard_30.txt AC 16 ms 1280 KB
02_rndhard_31.txt AC 16 ms 1280 KB
02_rndhard_32.txt TLE 2103 ms 1280 KB
02_rndhard_33.txt TLE 2103 ms 1280 KB
02_rndhard_34.txt TLE 2103 ms 1280 KB
02_rndhard_35.txt TLE 2103 ms 1280 KB
02_rndhard_36.txt TLE 2103 ms 1280 KB
02_rndhard_37.txt TLE 2103 ms 1280 KB
02_rndhard_38.txt TLE 2103 ms 1280 KB
02_rndhard_39.txt TLE 2103 ms 1280 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