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

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 1.0s

Memory limit: 64M

Author:

JeffreyZ

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 $N$ $N$ houses in Shahir's neighbourhood and $M$ $M$ roads that connect those $N$ $N$ 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 $1 \dots N$ $1 \dots N$ .

Shahir lives in house $A$ $A$ . His date lives in house $B$ $B$ . Is there a path of roads to follow such that Dhruvit can drive the packaged Shahir from house $A$ $A$ to house $B$ $B$ ? 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:

$N$ $N$ $(1 \le N \le 2\,000)$ $(1 \leq N \leq 2 000)$ : The number of houses in Shahir's neighbourhood.
$M$ $M$ $(0 \le M \le 2\,000)$ $(0 \leq M \leq 2 000)$ : The number of roads in Shahir's neighbourhood.
$A$ $A$ $(1 \le A \le N)$ $(1 \leq A \leq N)$ : Shahir lives in house $A$ $A$ .
$B$ $B$ $(1 \le B \le N)$ $(1 \leq B \leq N)$ : Shahir's date lives in house $B$ $B$ .

The next $M$ $M$ lines contain two space-separated integers $X$ $X$ and $Y$ $Y$ $(1 \le X, Y \le N)$ $(1 \leq X, Y \leq N)$ , denoting a road that connects house $X$ $X$ with house $Y$ $Y$ . 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

Copy

Sample Output 1

Copy

GO SHAHIR!

Explanation for Sample 1

Here is the graph of Shahir's neighbourhood:

$\text{[math]}$

Shahir's house is house $1$ $1$ . His date's house is at house $6$ $6$ . Dhruvit can drive Jeffrey from houses $1$ $1$ to $6$ $6$ by following the path $1 \to 2 \to 3 \to 4 \to 6$ $1 \to 2 \to 3 \to 4 \to 6$ or $1 \to 5 \to 4 \to 6$ $1 \to 5 \to 4 \to 6$ .

Sample Input 2

Copy

Sample Output 2

Copy

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 $4$ $4$ and $6$ $6$ is removed. As a result, Dhruvit can no longer drive Shahir to his date's house.

Comments

1

inoo commented on Jan. 25, 2024, 1:17 a.m.

Im just Gonna put Duct tape on Shahir's Box.

22

ryanawad commented on Nov. 24, 2021, 7:30 p.m.

This is a great problem for an introduction to graph theory

13

Kirito commented on Oct. 4, 2017, 2:12 p.m.

Note that even though the first sample case has $M > N$ $M > N$ , the actual test data has $M \leq N$ $M \leq N$ .

4

odaniel commented on Jan. 24, 2016, 12:19 a.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!

6

Vincent commented on Feb. 11, 2016, 2:49 p.m.

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