All Tracks Algorithms Graphs Shortest Path Algorithms Problem

Mancunian Goes To The Derby
Tag(s):

Easy-Medium, Graph Theory

Problem
Editorial
Analytics

It's derby weekend in Manchester. United vs City. The Red Devils vs The Noisy Neighbours. Mancunian has been waiting for this for a long time. But due to the huge popularity of the match, there is a lot of traffic on the streets. To control the rush, the police have devised an ingenious system of one-way roads which ensures smooth flow of traffic.

The city of Manchester can be modeled as a graph of $$N$$ nodes and $$E$$ edges. Vertices are numbered from $$1$$ to $$N$$. Each edge is a one-way road but direction depends on the time at which roads are traversed. If there is a road between checkpoints $$A$$ and $$B$$, it is directed from $$A$$ to $$B$$ in even-numbered seconds and $$B$$ to $$A$$ in odd-numbered seconds. Mancunian can move between adjacent vertices taking time 1 second. He can always choose to wait at some checkpoint for the roads to change their orientation. Mancunian's house is located at the point numbered $$1$$ and the venue of the match, Old Trafford (the Theatre of Dreams) is located at point $$N$$.

Given $$Q$$ possible start times, for each query you have to find out whether Mancunian can reach the stadium before the start of the match. He always starts his journey at time $$0$$.

Input format

The first line contains three integers $$N$$, $$E$$ and $$Q$$ denoting the number of checkpoints, number of roads in the city of Manchester and the number of possible start times of the match respectively.
Each of the next $$E$$ lines consists of two integers $$A$$ and $$B$$ describing a road in the city. It is guaranteed that there is no self-loop or multiple edge in the road network. Note that the line $$A$$ $$B$$ in the input is different from the line $$B$$ $$A$$ as they are directed opposite to each other.
The $$ith$$ of the next $$Q$$ lines contains a single integer, the $$ith$$ possible start time $$T_i$$ of the match,

Output format

Print $$Q$$ lines. Each line should contain a single word. Print "GGMU" (without quotes) if Mancunian can reach the stadium on time, and "FML"(without quotes) otherwise.

Constraints

  • $$1 \le N \le 100,000$$
  • $$1 \le E \le min(100,000, N*(N-1))$$
  • $$1 \le Q \le 50,000$$
  • $$1 \le A, B \le N$$
  • $$1 \le T_i \le 1,000,000,000$$
SAMPLE INPUT
4 3 2
1 2
2 3
4 3
1
20
SAMPLE OUTPUT
FML
GGMU
Explanation

In the first query, at time $$0$$, Mancunian is located at vertex $$1$$ and the orientation of edges is $$1$$->$$2$$, $$2$$->$$3$$ and $$4$$->$$3$$. He moves to vertex $$2$$. By then he has already crossed the maximum time allotted and hence, he doesn't reach the stadium on time.

In the second query, one of the possible solutions is as follows. Mancunian waits at vertex $$1$$ for 4 seconds. Then the orientation of the roads is $$1$$->$$2$$, $$2$$->$$3$$ and $$4$$->$$3$$. He moves to vertex $$2$$. Then the orientation of the roads is $$2$$->$$1$$, $$3$$->$$2$$ and $$3$$->$$4$$. He waits for 1 second and moves to vertex $$3$$. Then the orientation of the roads is $$2$$->$$1$$, $$3$$->$$2$$ and $$3$$->$$4$$. He waits at vertex $$3$$ for 4 seconds, after which he moves to vertex $$4$$ and hence reaches his destination well before the start of the match, taking a total time of 12 seconds.

Time Limit: 2.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Visual Basic, Kotlin

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

HackerEarth

Challenge Name

August Easy '16

OTHER PROBLEMS OF THIS CHALLENGE
Notifications
View All Notifications