WORDS1 - Play on Words

Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important for us.

There is a large number of magnetic plates on every door. Every plate has one word written on it. The plates must be arranged into a sequence in such a way that every word begins with the same letter as the previous word ends. For example, the word ``acm'' can be followed by the word ``motorola''. Your task is to write a computer program that will read the list of words and determine whether it is possible to arrange all of the plates in a sequence (according to the given rule) and consequently to open the door.


The input consists of T test cases. The number of them (T, equal to about 500) is given on the first line of the input file. Each test case begins with a line containing a single integer number N that indicates the number of plates (1 <= N <= 100000). Then exactly Nlines follow, each containing a single word. Each word contains at least two and at most 1000 lowercase characters, that means only letters 'a' through 'z' will appear in the word. The same word may appear several times in the list.


Your program has to determine whether it is possible to arrange all the plates in a sequence such that the first letter of each word is equal to the last letter of the previous word. All the plates from the list must be used, each exactly once. The words mentioned several times must be used that number of times.

If there exists such an ordering of plates, your program should print the sentence "Ordering is possible.". Otherwise, output the sentence "The door cannot be opened.".


Sample input:

Sample output:
The door cannot be opened.
Ordering is possible.
The door cannot be opened.

Warning: large Input/Output data, be careful with certain languages

hide comments
preethaudhayakumar: 2012-01-12 18:58:26

can anyone help me, i got segmentation fault for my code.
my source code is here:http://www.ideone.com/7xIRV

Dummer Pedraza: 2011-09-13 19:40:29

What will be the output of:


Last edit: 2011-09-13 22:03:56
Zoyla Dulce Piña del Bosque: 2011-07-10 12:19:35

What will be the output of:

Santiago Palacio: 2011-05-26 23:00:04

Seshadri, it means how much time has passed since the solution was summited, darker is more recently

multisystem: 2011-03-26 23:28:45


Last edit: 2011-03-26 23:31:45
suresh: 2011-05-29 18:53:02

Last edit: 2011-02-06 17:00:07
Nanda Bagus Pradnyana: 2011-01-16 09:23:47

is just by comparing last letter from previous word to present word's first letter? i got WA by doing this. :I

Mitch Schwartz: 2010-09-28 06:28:59

It's evident from the second test case, but just to be very explicit: The first letter of the first word need not match the last letter of the last word.

Last edit: 2010-09-28 06:30:54
~!(*(@*!@^&: 2010-04-21 04:23:18

nice problem

Michael Andrevsky: 2009-12-08 04:48:13

What is the problem??? In my comp. there is OK. but in 1-test answered: TL.

Last edit: 2009-12-08 05:06:05

Added by:adrian
Time limit:20s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:ACM Central European Programming Contest, Prague 1999