IM - Intergalactic Map
Jedi knights, Qui-Gon Jinn and his young apprentice Obi-Wan Kenobi, are entrusted by Queen Padmé Amidala
to save Naboo from an invasion by the Trade Federation. They must leave Naboo immediately and go to Tatooine
to pick up the proof of the Federation’s evil design. They then must proceed on to the Republic’s capital
planet Coruscant to produce it in front of the Republic’s Senate. To help them in this endeavor, the queen’s captain provides them with an intergalactic map. This map shows connections between planets not yet blockaded by the Trade Federation. Any pair of planets has at most one connection between them, and all the connections are two-way. To avoid detection by enemy spies, the knights must embark on this adventure without visiting any planet more than once. Can you help them by determining if such a path exists?
Note - In the attached map, the desired path is shown in bold.
The first line of the input is a positive integer t ≤ 20, which is the number of test cases. The descriptions of the test cases follow one after the other. The first line of each test case is a pair of positive integers n, m (separated by a single space). 2 ≤ n ≤ 30011 is the number of planets and m ≤ 50011 is the number of connections between planets. The planets are indexed with integers from 1 to n. The indices of Naboo, Tatooine and Coruscant are 1, 2, 3 respectively. The next m lines contain two integers each, giving pairs of planets that have a connection between them.
The output should contain t lines. The ith line corresponds to the ith test case. The output for each test case should be YES if the required path exists and NO otherwise.
m can be greater than 50011,
What a disappointing problem.
Karlvin is right, test cases are weak.
Some m seem more than 50011
The test cases seem to have out of range vertex indices. I got a segmentation fault. This should have been mentioned in the problem statement. I ignored edges with out of range vertex indices and my solution was accepted.
I get "accepted" while I find a case" 5 5 2 4 2 5 4 1 5 1 1 3" proving my program wrong. What is the answer supposed to be? My accepted-solution says "YES".
Is not funny when we have to deal with values in the test data out of ranges specified in text :(. Too many RE because of that.
As others said vertex numbers > n. Beware!
Be careful of ids >nLast edit: 2010-05-28 17:09:48
The old C++ is still allowed, but the new C++ 4.3.2 isn't, presumably due to a bug in the system. (Either that, or the author actually didn't check the "include new languages" box...)
|Added by:||Kashyap KBR|
|Cluster:||Cube (Intel G860)|
|Languages:||ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCM qobi SCM guile ST WHITESPACE|
|Resource:||Fair Isaac Programming Challenge - prelims 2006|