Contest Duration: ~ (local time) (90 minutes) Back to Home

Submission #420839

Source Code Expand

Copy
```# -*- coding: utf-8 -*-
H, W = map(int, raw_input().split())
blocks = []
start = (-1,-1)
goal = (-1,-1)
for i in range(H):
street = raw_input()
if 's' in street:
start = (i,street.index('s'))
if 'g' in street:
goal = (i,street.index('g'))
blocks.append(street)
visited = {}
stack = []
stack.append(start)
visited[start]=1
flag = False
while stack:
cur = stack.pop()
if cur[0]+1<H and (cur[0]+1,cur[1]) not in visited:
if blocks[cur[0]+1][cur[1]] == '.':
stack.append((cur[0]+1,cur[1]))
visited[(cur[0]+1,cur[1])]=1
if blocks[cur[0]+1][cur[1]] == 'g':
flag = True
break
if cur[0]-1>=0 and (cur[0]-1,cur[1]) not in visited:
if blocks[cur[0]-1][cur[1]] == '.':
stack.append((cur[0]-1,cur[1]))
visited[(cur[0]-1,cur[1])]=1
if blocks[cur[0]-1][cur[1]] == 'g':
flag = True
break
if cur[1]-1>=0 and (cur[0],cur[1]-1) not in visited:
if blocks[cur[0]][cur[1]-1] == '.':
stack.append((cur[0],cur[1]-1))
visited[(cur[0],cur[1]-1)]=1
if blocks[cur[0]][cur[1]-1] == 'g':
flag = True
break
if cur[1]+1<W and (cur[0],cur[1]+1) not in visited:
if blocks[cur[0]][cur[1]+1] == '.':
stack.append((cur[0],cur[1]+1))
visited[(cur[0],cur[1]+1)]=1
if blocks[cur[0]][cur[1]+1] == 'g':
flag = True
break
if flag:
print "Yes"
else:
print "No"
```

#### Submission Info

Submission Time 2015-06-06 21:55:38+0900 A - 深さ優先探索 adf2015_short7 Python (2.7.3) 100 1585 Byte AC 818 ms 24672 KB

#### 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 100 / 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 69 ms 3436 KB
00_min_02.txt 55 ms 3500 KB
00_min_03.txt 56 ms 3496 KB
00_min_04.txt 58 ms 3508 KB
00_min_05.txt 57 ms 3508 KB
00_min_06.txt 56 ms 3504 KB
00_min_07.txt 57 ms 3500 KB
00_min_08.txt 55 ms 3500 KB
00_sample_01.txt 55 ms 3508 KB
00_sample_02.txt 56 ms 3508 KB
00_sample_03.txt 57 ms 3504 KB
00_sample_04.txt 56 ms 3508 KB
00_sample_05.txt 57 ms 3500 KB
01_rnd_00.txt 61 ms 3872 KB
01_rnd_01.txt 511 ms 24672 KB
01_rnd_02.txt 472 ms 15512 KB
01_rnd_03.txt 448 ms 24316 KB
01_rnd_04.txt 71 ms 4264 KB
01_rnd_05.txt 61 ms 3884 KB
01_rnd_06.txt 399 ms 14304 KB
01_rnd_07.txt 470 ms 15976 KB
01_rnd_08.txt 62 ms 3688 KB
01_rnd_09.txt 61 ms 3892 KB
01_rnd_10.txt 666 ms 20836 KB
01_rnd_11.txt 61 ms 3880 KB
01_rnd_12.txt 525 ms 23140 KB
01_rnd_13.txt 119 ms 6248 KB
01_rnd_14.txt 61 ms 3884 KB
01_rnd_15.txt 741 ms 21600 KB
01_rnd_16.txt 61 ms 3888 KB
01_rnd_17.txt 818 ms 21988 KB
01_rnd_18.txt 61 ms 3888 KB
01_rnd_19.txt 374 ms 16352 KB
02_rndhard_00.txt 67 ms 3888 KB
02_rndhard_01.txt 68 ms 3888 KB
02_rndhard_02.txt 213 ms 9452 KB
02_rndhard_03.txt 197 ms 9456 KB
02_rndhard_04.txt 63 ms 3884 KB
02_rndhard_05.txt 64 ms 3828 KB
02_rndhard_06.txt 64 ms 3872 KB
02_rndhard_07.txt 62 ms 3880 KB
02_rndhard_08.txt 96 ms 5160 KB
02_rndhard_09.txt 98 ms 5160 KB
02_rndhard_10.txt 93 ms 5028 KB
02_rndhard_11.txt 93 ms 5040 KB
02_rndhard_12.txt 80 ms 4140 KB
02_rndhard_13.txt 79 ms 4140 KB
02_rndhard_14.txt 94 ms 5164 KB
02_rndhard_15.txt 94 ms 4988 KB
02_rndhard_16.txt 63 ms 3880 KB
02_rndhard_17.txt 63 ms 3876 KB
02_rndhard_18.txt 66 ms 3876 KB
02_rndhard_19.txt 65 ms 3892 KB
02_rndhard_20.txt 65 ms 3816 KB
02_rndhard_21.txt 67 ms 3808 KB
02_rndhard_22.txt 85 ms 4260 KB
02_rndhard_23.txt 77 ms 4144 KB
02_rndhard_24.txt 66 ms 3888 KB
02_rndhard_25.txt 64 ms 3892 KB
02_rndhard_26.txt 67 ms 3880 KB
02_rndhard_27.txt 62 ms 3880 KB
02_rndhard_28.txt 71 ms 3872 KB
02_rndhard_29.txt 71 ms 3876 KB
02_rndhard_30.txt 68 ms 3876 KB
02_rndhard_31.txt 64 ms 3884 KB
02_rndhard_32.txt 82 ms 4136 KB
02_rndhard_33.txt 80 ms 4136 KB
02_rndhard_34.txt 65 ms 3876 KB
02_rndhard_35.txt 66 ms 3876 KB
02_rndhard_36.txt 64 ms 3876 KB
02_rndhard_37.txt 64 ms 3880 KB
02_rndhard_38.txt 67 ms 3880 KB
02_rndhard_39.txt 67 ms 3880 KB
03_rndhardsmall_00.txt 57 ms 3508 KB
03_rndhardsmall_01.txt 56 ms 3504 KB
03_rndhardsmall_02.txt 56 ms 3508 KB
03_rndhardsmall_03.txt 57 ms 3504 KB
03_rndhardsmall_04.txt 57 ms 3500 KB
03_rndhardsmall_05.txt 57 ms 3496 KB
03_rndhardsmall_06.txt 55 ms 3512 KB
03_rndhardsmall_07.txt 54 ms 3504 KB
03_rndhardsmall_08.txt 57 ms 3496 KB
03_rndhardsmall_09.txt 57 ms 3496 KB