SGU 327 problem — please help

Revision en2, by RomeoFantastik, 2015-10-19 17:11:31

Hi guys! I was trying to solve problem 327 on SGU (http://acm.sgu.ru/problem.php?problem=327) , at the moment I can't acces the link so I will describe it here : We have n (n < = 14) words with length of maximum 30 exnglish letters. We have to determine the shortest string which has all of this words as subsequences and is a palindrome. Example :

4 abcd cdef efef fed

Solution : abcdefefedracba

SPOILER ALERT :

It is a problem of Hamilton Cycle , but really don't know how, I think we can add some more n words, the reversed ones of the ones from input.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English RomeoFantastik 2015-10-19 18:18:44 2 Tiny change: 'abcdefefedracba\n\nSPO' -> 'abcdefefedcba\n\nSPO'
en4 English RomeoFantastik 2015-10-19 17:27:46 19 Tiny change: 'alindrome.\n\nExampl' -> 'alindrome. Time limit : 0.25s\n\nExampl'
en3 English RomeoFantastik 2015-10-19 17:11:54 2 Tiny change: 'indrome.\nExample ' -> 'indrome.\n\nExample '
en2 English RomeoFantastik 2015-10-19 17:11:31 9
en1 English RomeoFantastik 2015-10-19 17:10:43 601 Initial revision (published)