| ENG RUS | Timus Online Judge |
Обсуждение задачи 1772. Лыжни для роботовivanzakharov WA #23 try this [1] // Задача 1772. Лыжни для роботов 6 мар 2021 14:36 10 4 2 1 2 8 10 answer: 0 11 6 3 1 2 10 11 5 7 answer: 2 Edited by author 06.03.2021 15:54 Walker Re: WA #23 try this // Задача 1772. Лыжни для роботов 18 май 2021 18:40 thanks moji WA 27 [1] // Задача 1772. Лыжни для роботов 16 июл 2013 08:42 very usual segment tree, that helps to fill dynamic vars. I wonder if anyone have been had the same problem... help! moji Re: WA 27 // Задача 1772. Лыжни для роботов 16 июл 2013 08:52 found it; I wasn't careful about the length of the array. Edited by author 16.07.2013 08:53 Edited by author 16.07.2013 08:53 sure need algorithm for 1772. Ski-Trails for Robots // Задача 1772. Лыжни для роботов 22 мар 2012 22:52 actually i dont have any idea for this my sir gave me this assessment i want to solve this problem please help me how to start the program and which concepts we want to use Olya Chistokova if you have wa 23 try this // Задача 1772. Лыжни для роботов 12 янв 2012 10:41 6 2 3 4 5 2 3 4 5 answer is 1 Aleksandr Konovalov To admins [1] // Задача 1772. Лыжни для роботов 10 янв 2012 22:37 Hello! I found the following interesting test: n 1 n 1 1 2 2 3 3 ... n-1 n-1 1 n-1 where n is a large number (such as 100000) The result is n-1 Sandro (USU) Your test was added. Thank you. (-) // Задача 1772. Лыжни для роботов 11 янв 2012 01:10 Marshall Mathers Shortest Path Algorithm does work // Задача 1772. Лыжни для роботов 5 июн 2011 21:32 Marginean Ciprian Test 6 [1] // Задача 1772. Лыжни для роботов 24 сен 2010 15:40 I was talking bullshit if you read this before. Test 6 has k = 0, that was my problem. Edited by author 24.09.2010 19:18 Marshall Mathers Re: Test 6 // Задача 1772. Лыжни для роботов 5 июн 2011 08:25 Be clean. Aneto why I get wa on test 23? [3] // Задача 1772. Лыжни для роботов 28 июл 2010 21:06 why I get wa on test 23? Aneto Re: why I get wa on test 23? [2] // Задача 1772. Лыжни для роботов 31 июл 2010 04:01 this problem ROCKS >D r1d1 Re: why I get wa on test 23? [1] // Задача 1772. Лыжни для роботов 1 авг 2010 08:32 Try it: 8 3 3 2 4 5 8 1 6 Answer: 6 Marginean Ciprian Re: why I get wa on test 23? // Задача 1772. Лыжни для роботов 22 сен 2010 15:14 What is the answer for the test: 10 5 2 2 8 4 6 ? Mine is 4. Am I correct? Or is the answer 6 or 10? L.E.: Nevermind I ACed. Answer is 4. Edited by author 22.09.2010 20:24 Edited by author 24.09.2010 01:45 Marginean Ciprian WA15 // Задача 1772. Лыжни для роботов 21 сен 2010 15:44 I use sqrt decomposition and some DP. My DP idea is to keep for each robot the shortest path which we can find if we detour by left or right. And I use sqrt decomposition to find the next encountered robot on the current path. Could someone give me a tricky example? Edit: I wrote the update of the sqrt decomposition again(different) and now I get WA23. Edited by author 22.09.2010 15:13 Sergey Martynov why I get wa on test 34? // Задача 1772. Лыжни для роботов 8 авг 2010 20:18 why I get wa on test 34? Fdg How to solve it? [2] // Задача 1772. Лыжни для роботов 14 апр 2010 21:46 dAFTc0d3r [Yaroslavl SU] Re: How to solve it? // Задача 1772. Лыжни для роботов 15 апр 2010 10:01 DP + sqrt-decomposition (or tree-like structure) svr Re: How to solve it? // Задача 1772. Лыжни для роботов 31 июл 2010 14:43 I think that Djkstra in graph of robot's ends will work. lql1993 No subject [1] // Задача 1772. Лыжни для роботов 30 апр 2010 17:12 why I get wa on test 39? Edited by author 30.04.2010 17:12 Moonstone If you have WA 39 // Задача 1772. Лыжни для роботов 10 май 2010 21:07 Use long instead of int.
|