| ENG RUS | Timus Online Judge |
Обсуждение задачи 1861. Кладбище в ДейеToshpulatov (MSU Tashkent) hint // Задача 1861. Кладбище в Дейе 26 фев 2021 23:41 KMP + DP, O(n ^ 2) AGrigorii [Yaroslavl SU] 🔥 wrong AC // Задача 1861. Кладбище в Дейе 24 июл 2017 04:23 ?????abxxxab????? abab output: 3 answer: 4 Felix_Mate I'm angry! // Задача 1861. Кладбище в Дейе 22 июн 2017 23:43 I wrote program on C++ and got WA1. I rewrote program on Pascal and got AC. I think my error in input string. How do i read lines? My attempts: 1) int c; n=0; while ((c = getchar()) != EOF) { if(c=='\n') break; s[++n]=c; } m=0; while ((c = getchar()) != EOF) t[++m]=(char)c; 2) void Input() { int c; scanf("%c",&c); n=0; while (c!='\n') { s[++n]=c; scanf("%c",&c); } m=0; while ((c = getchar()) != EOF) t[++m]=(char)c; } Probably <string> will help, but i prefer work with index>=1. Edited by author 22.06.2017 23:44 Edited by author 22.06.2017 23:44 † SiriuS † TO ADMINS // Задача 1861. Кладбище в Дейе 19 ноя 2015 16:30 My AC program gives wrong answer on this test: ?????xy????? xyxy My answer: 3 Right answer: 4 Sunnat WA 3 [1] // Задача 1861. Кладбище в Дейе 13 ноя 2012 00:04 Edited by author 13.11.2012 12:52 Adhambek Re: WA 3 // Задача 1861. Кладбище в Дейе 11 июн 2015 14:07 try this test case : Input: ababababab aba Output: 4 AYUBXON UBAYDULLAYEV TUIT WA 3 // Задача 1861. Кладбище в Дейе 12 ноя 2012 20:03 why WA #3, please, give me any test ... AYUBXON UBAYDULLAYEV TUIT No subject // Задача 1861. Кладбище в Дейе 12 ноя 2012 20:03 Edited by author 12.11.2012 20:03 Mehemmed Veliyev[Azerbaijan] No subject // Задача 1861. Кладбище в Дейе 28 дек 2011 00:05 I have a problem Crash(access violation) help me please Sorry for poor English hatred Why 1? [1] // Задача 1861. Кладбище в Дейе 14 окт 2011 21:00 In 2 sample: Arch?????rchibaldIronfist Archibald but we can put Archibald from 1st position and from 9th position. Why answer is 1? morbidel Re: Why 1? // Задача 1861. Кладбище в Дейе 14 окт 2011 21:20 Because it cannot appear on BOTH 1 and 9 positions. 72VanVector[SevNTU] Some hints needed. [3] // Задача 1861. Кладбище в Дейе 24 сен 2011 22:19 Can somebody give hints to solve this task? svr Re: Some hints needed. [2] // Задача 1861. Кладбище в Дейе 8 окт 2011 19:06 Conflict graph may help. Positions of possible substrings are vertices and two positions conflict if they can not be simultaneously. Answer= max number of independent vertices. Also let relation a<b means that position is before of position b and they don't conflict.Then a<b,b<c=> a<c so we have an order. Answer is a height of ordered structure. Edited by author 08.10.2011 19:07 bsu.mmf.team Re: Some hints needed. [1] // Задача 1861. Кладбище в Дейе 9 окт 2011 02:04 Just easy DP. svr Re: Some hints needed. // Задача 1861. Кладбище в Дейе 10 окт 2011 11:47 But Dp may be difficult- problem of 35 test. When poset is used and standard dfs for it's height we have Ac without any problems. MOPDOBOPOT (USU) WA 35 [6] // Задача 1861. Кладбище в Дейе 24 сен 2011 16:04 Need for some tests :( Edited by author 24.09.2011 16:05 72VanVector[SevNTU] Re: WA 35 [1] // Задача 1861. Кладбище в Дейе 24 сен 2011 17:24 me 2 72VanVector[SevNTU] Re: WA 35 // Задача 1861. Кладбище в Дейе 24 сен 2011 17:26 Was using simple algorithm. complexity O((n - m + 1) * m). WA 35 Yermak Re: WA 35 [3] // Задача 1861. Кладбище в Дейе 24 сен 2011 19:44 Try this: ?????ab abab Ans - 2. 72VanVector[SevNTU] Re: WA 35 // Задача 1861. Кладбище в Дейе 24 сен 2011 20:53 Thanks... not too much exp in string algo( Does it suppose some KMP-algo modification? Edited by author 24.09.2011 20:56 Try_to_try Re: WA 35 [1] // Задача 1861. Кладбище в Дейе 24 сен 2011 21:24 My program passed this test but still gets WA 35 :( Pavel Kovalenko Re: WA 35 // Задача 1861. Кладбище в Дейе 27 сен 2011 16:58 Your DP is wrong. I also got WA 35 in my first solution. Revanth compilation error // Задача 1861. Кладбище в Дейе 24 сен 2011 16:53 it was compiled fine in my system... but i dont know why it was showing compilation error when i submit... please help me !!
|