| ENG RUS | Timus Online Judge |
Обсуждение задачи 1669. Универсальное словоpanyong0202 how to prove the answer is NO when k > 20 // Задача 1669. Универсальное слово 30 ноя 2014 18:19 I have got ac by return NO when k > 20, but how to prove it? IgorKoval(from Pskov) What is algo? [1] // Задача 1669. Универсальное слово 23 апр 2012 00:39 What is algo? =) IgorKoval [PskovSU] Re: What is algo? // Задача 1669. Универсальное слово 29 сен 2013 16:23 simple DP: int leftPos[char][pos] position of char which is left or equal of pos int lastPos[mask] : for substring s[lastPos[mask]..s.length()-1] we can get all name of sportman with char which is in mask. =) Orthocenter test 70： n == 18 and answer is YES // Задача 1669. Универсальное слово 8 мар 2012 13:37 SevenEleven [Tartu U] How to avoid TLE [4] // Задача 1669. Универсальное слово 31 дек 2008 16:02 Can M*N*2^(n) dp solution be improved, so that it passes all test? ( Probably it could be M*2^(n)), or it's wrong and I have to think on completely new solution? vav[14] Re: How to avoid TLE [2] // Задача 1669. Универсальное слово 5 янв 2009 19:28 Yes. It can be easily optimized to O(N*log|S|*2^N).(|S| - is the length of the word). But even O(N*|S|*2^N) solution can pass all tests. Alexander Georgiev Re: How to avoid TLE [1] // Задача 1669. Универсальное слово 24 фев 2009 03:50 Well, my n * s * 2^n solution didn't pass until I added a (as it turned out) curcial optimization. Edited by author 27.07.2009 03:08 ConanKudo Re: How to avoid TLE // Задача 1669. Универсальное слово 1 авг 2010 16:58 My solution is s*2^n ... it runs extremely fast with a very short code :) Edited by author 01.08.2010 16:59 Edited by author 01.08.2010 16:59 Oracle[Lviv NU] Re: How to avoid TLE // Задача 1669. Универсальное слово 20 авг 2011 19:56 N*2^N exists. Gandalf Wonder what's the solutions which runs in 0.1 second? // Задача 1669. Универсальное слово 20 фев 2010 18:29 Vanja Petrovic Tankovic Wrong Answer #73 [2] // Задача 1669. Универсальное слово 3 май 2009 00:19 I don't print 'NO' if N is large, I check it normally, but I still get WA #73? Whats the trick with this test? Is there a word that is 'YES' for N>18? Edited by author 03.05.2009 00:44 Vedernikoff Sergey (HSE: АОП) Re: Wrong Answer #73 [1] // Задача 1669. Универсальное слово 3 май 2009 14:08 My AC program assumes there is no string with N>18, so debug your code Vanja Petrovic Tankovic Re: Wrong Answer #73 // Задача 1669. Универсальное слово 3 май 2009 15:20 Thanks, I had a silly bug. Varun Sharma Time Limit Exceeded - Test #14 // Задача 1669. Универсальное слово 30 апр 2009 09:29 Hi, For large test cases like n = 18 etc, if the answer is Yes, does that mean that our program will need to test for all the 18 factorial possibilities ? That's like running the loop 10^16 times which is impossible within 3 seconds ! Thanks Yulia Is n<=8??? (If the word has <300 letters) [4] // Задача 1669. Универсальное слово 20 дек 2008 18:12 Cu-star Re: Is n<=8??? (If the word has <300 letters) [1] // Задача 1669. Универсальное слово 20 дек 2008 20:46 NO. there are some pattern that satisfy for n>8 Edited by author 20.12.2008 20:49 Piratek-(akaDK) Re: Is n<=8??? (If the word has <300 letters) // Задача 1669. Универсальное слово 25 дек 2008 13:26 Suppose secuence like abcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklmabcdefghjklm etc.. Tbilisi SU: Giorgi , Akaki , [Andrew] Re: Is n<=8??? (If the word has <300 letters) [1] // Задача 1669. Универсальное слово 1 фев 2009 14:54 I have WA 70. please tell me is there any test case where n == 18 && answer == "YES"? Tbilisi SU: Giorgi , Akaki , [Andrew] Re: Is n<=8??? (If the word has <300 letters) // Задача 1669. Универсальное слово 2 фев 2009 00:03 int test 70 n == 18 and answer is YES ;) vav[14] No subject // Задача 1669. Универсальное слово 26 дек 2008 14:05 Edited by author 28.12.2008 21:37 Edited by author 28.12.2008 21:38 Sandro (USU) New test (+) // Задача 1669. Универсальное слово 21 дек 2008 22:46 We analysed AC solutions of this problem from online contest and add new test. 3 solutions from contest output wrong answer on it. Cu-star wrong answer #8 [5] // Задача 1669. Универсальное слово 20 дек 2008 16:12 i don't know why WA in test 8. please help SADAM (Irkutsk STU) Re: wrong answer #8 [4] // Задача 1669. Универсальное слово 20 дек 2008 17:38 try this test: 4 abcabcab Cu-star Re: wrong answer #8 // Задача 1669. Универсальное слово 20 дек 2008 18:28 thx very much i can find the mistake. but i don't know how to correct Irkutsk STU 2 Re: wrong answer #8 [2] // Задача 1669. Универсальное слово 20 дек 2008 20:28 I have faced the same problem. The test 8 - WA. On the test: 4 abcabcab The algorithm answers NO Cu-star Re: wrong answer #8 [1] // Задача 1669. Универсальное слово 20 дек 2008 20:52 i correct it for this problem it must answer YES. i use another algorithm but got WA in test 28. plz. help thx. Irkutsk STU 2 Re: wrong answer #8 // Задача 1669. Универсальное слово 21 дек 2008 07:29 Why on the test: 4 abcabcab The answer - YES? In the example there is no letter d wFeral when will these problems add to prob. set? [1] // Задача 1669. Универсальное слово 20 дек 2008 19:30 when? Sandro (USU) Added (-) // Задача 1669. Универсальное слово 20 дек 2008 19:38 Marginean Ciprian How many tests are there? // Задача 1669. Универсальное слово 20 дек 2008 17:45 I saw WA#70.
|