| ENG RUS | Timus Online Judge |
Обсуждение задачи 1606. Слаломzhangweilst For those who have WA#6 // Задача 1606. Слалом 29 ноя 2015 11:15 This is when there's only one pole. 1 1 2 The answer should be: 1 1 Alexey Dergunov [Samara SAU] If you have WA 3 // Задача 1606. Слалом 13 июл 2012 14:41 Try this test: 4 4 4 1 3 2 2 3 1 r1d1 What answer on this test? [1] // Задача 1606. Слалом 14 июл 2010 12:49 3 2 1 2 3 2 4 This sample correct? Edited by author 14.07.2010 13:02 Kolyanich Re: What answer on this test? // Задача 1606. Слалом 5 июл 2011 11:06 yes, it is correct. for both of samples below answer is 1 (anyone of poles) 3 1 2 3 2 4 2 3 2 1 2 3 2 4 Sandro (USU) Problem 1606 "Slalom". TL is decreased to 1 sec. (-) // Задача 1606. Слалом 4 янв 2011 16:07 Dimitar Dimitrov WA #6 // Задача 1606. Слалом 20 июл 2009 00:21 Any idea what is that test case ? AlMag(VNTU) Some of u, AC'rs, had WA12, don't u? (-) [1] // Задача 1606. Слалом 24 апр 2009 11:56 AlMag(VNTU) Re: Some of u, AC'rs, had WA12, don't u? (-) // Задача 1606. Слалом 24 апр 2009 13:32 nevermind, AC kavolorn are there inaccuracy conditions?.. [2] // Задача 1606. Слалом 2 мар 2008 11:57 I think there is inaccuracy in conditions. I answer the first example 2 5 1 3. Why is not it correct? Edited by author 02.03.2008 12:04 kavolorn Re: are there inaccuracy conditions?.. // Задача 1606. Слалом 2 мар 2008 17:02 ok.. ive found mistake Филиппов Илья (УЛ) Re: are there inaccuracy conditions?.. // Задача 1606. Слалом 14 июл 2008 13:52 2 5 1 3 - is it correct. Edited by author 14.07.2008 22:50 obtuseSword How many test cases are there? [8] // Задача 1606. Слалом 7 мар 2008 09:50 I've got TLE at Test#10,so I want to know how many test cases there are. If there are only near 10 cases,I'll improve on my program,or else,I'll give it up. Who can help me? Vedernikoff Sergey Re: How many test cases are there? [7] // Задача 1606. Слалом 7 мар 2008 16:22 I suppose there are much more than 10 testcases. My solution works about 0.1 sec on any test, so timelimit is quite enough. Try to create quicker algo... obtuseSword Re: How many test cases are there? [6] // Задача 1606. Слалом 11 мар 2008 13:12 Thank you. I've found that greedy algorithm can solve this problem,thus no longer need dynamic progrmming. And I've got AC. igaoxiang Re: How many test cases are there? [5] // Задача 1606. Слалом 13 мар 2008 16:58 Can you tell me your greedy algorithm? Chmel_Tolstiy Re: How many test cases are there? [4] // Задача 1606. Слалом 13 мар 2008 19:21 Greedy? Please tell us your idea. svr Re: How many test cases are there? [3] // Задача 1606. Слалом 13 мар 2008 19:52 I think that "greedy" here is terminologic mismatch. Right termin is "simple constructive" algo. Candidat to optimum easy to find simply tracing trajectory of all points sorted by y- coordinate. Vedernikoff Sergey Re: How many test cases are there? [2] // Задача 1606. Слалом 14 мар 2008 17:29 Not mismatch at all. The simplest way to solve the problem is to find a greedy algo. Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) Re: to find a greedy algo [1] // Задача 1606. Слалом 20 мар 2008 14:25 I solved it with DP+date structure like "the stars" task. 0.578 sec, 44 896 КB... How to solve it with greedy algo? Nguyen Dinh Tu (DHSP) Re: to find a greedy algo // Задача 1606. Слалом 19 апр 2008 00:28 Data structure i used is Binary Index Tree
|