## VM7WC '16 #3 Silver - Can Shahir even get there?!

View as PDF

Points: 5
Time limit: 1.0s
Memory limit: 64M

Author:
Problem type

Shahir was already taped shut in the box when it occurred to him that he didn't know if it was possible to get from his house to his prom date's. That's no problem: he asks one of the friends that will deliver him, Dhruvit, to check.

There are houses in Shahir's neighbourhood, and roads that connect those houses. Each road connects two houses. All roads can be traveled down both directions. Each house is distinctly numbered and identified by a number in the range .

Shahir lives in house . His date lives in house . Is there a path of roads to follow such that Dhruvit can drive the packaged Shahir from house to house ? Dhruvit wrote (and you, vicariously, will write) a program to answer that question.

#### Input Specification

The first line will contain four integers, separated by spaces:

• : The number of houses in Shahir's neighbourhood.
• : The number of roads in Shahir's neighbourhood.
• : Shahir lives in house A.
• : Shahir's date lives in house B.

The next lines contain two space-separated integers and , denoting a road that connects house with house . Two roads will never connect the same two houses.

#### Output Specification

On a single line, print GO SHAHIR! if Shahir can make it to his date's house. Otherwise, print NO SHAHIR!.

#### Sample Input 1

6 7 1 6
1 2
2 3
2 5
5 1
3 4
4 5
4 6

#### Sample Output 1

GO SHAHIR!

#### Explanation for Sample 1

Here is the graph of Shahir's neighbourhood:

Shahir's house is house . His date's house is at house . Dhruvit can drive Jeffrey from houses to by following the path or .

#### Sample Input 2

6 6 1 6
1 2
2 3
2 5
5 1
3 4
4 5

#### Sample Output 2

NO SHAHIR!

#### Explanation for Sample 2

This map of Shahir's neighbourhood is the same as the one in Sample 1, but the edge between houses and is removed. As a result, Dhruvit can no longer drive Shahir to his date's house.

• commented on Jan. 25, 2021, 6:05 p.m.

Hi, I don't know why my code got WA on all the test cases but it seems to work fine on the sample inputs. Here is a link to my submission Code

• commented on Jan. 25, 2021, 6:22 p.m.

You spelt shahir wrong.

• commented on Jan. 25, 2021, 7:08 p.m.

Thank you. It works now, that was pretty embarrassing.

• commented on May 24, 2020, 2:52 p.m.

I always get case #5 wrong so how would I go about checking for corner cases

• commented on May 24, 2020, 3:21 p.m.

Think what your program might output if .

• commented on May 24, 2020, 5:39 p.m.

Thanks

• commented on Feb. 18, 2019, 6:36 p.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Feb. 18, 2019, 8:17 p.m.

• commented on Nov. 8, 2018, 9:40 p.m.

I'm getting segfaults and bad_alloc for all the test cases. The segfaults might be from indexing arrays out of bounds, but I'm not sure why I'm getting bad_alloc, considering I don't use any dynamically allocated memory with new. I'm not quite sure what's going on...

• commented on Oct. 4, 2017, 10:12 a.m.

Note that even though the first sample case has , the actual test data has .

• commented on July 1, 2017, 10:05 p.m. edited

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Jan. 23, 2016, 7:19 p.m. edited

I keep getting WA on #5. I'm probably in the wrong here, but I'm just checking as I'm the only Python 2 submission, and I have gotten the short end of the data precision stick before...

EDIT: Nevermind, corner cases are my life! Thanks all!

• commented on Feb. 11, 2016, 9:49 a.m.

yes there is a problem, you have to check all of the corner cases.