| ENG RUS | Timus Online Judge |
Обсуждение задачи 1624. Go out of here!Programmer WA13? // Задача 1624. Go out of here! 24 апр 2010 03:53 Kurpilyansky Evgeny (USU) Why TL such a large? [6] // Задача 1624. Go out of here! 27 авг 2008 23:59 Accepted 0.062 1 486 КБ I solve this problem with O(log K*(K+(W*H)^2)). P.S. Sorry for my bad English. Vedernikoff Sergey (HSE: EconomicsForever!) Re: Why TL such a large? [5] // Задача 1624. Go out of here! 28 авг 2008 03:41 My algo's complexity is the same (haven't applied yet). Maybe, author have less efficient algo. Maybe, you realization is pretty fast... SPb-MaxBuzz Re: Why TL such a large? [4] // Задача 1624. Go out of here! 24 ноя 2008 08:51 Well, the solution and the tests for this problem were written when I had just finished the first course. I had been quite a "weak" programmer that time. Actually, I'd implemented the first solution that came in my head and designed TLs and tests for it. Certainly, this problem had been stored on HDD without any change for one and a half year, and then it was given to the PTZ camp. Yes, we designed a lot of more efficient solutions, but it was laziness that prevented me from implementing them and creating new tests. Nevertheless, probably it would be better for the tests to be unchanged. As I can see, this problem remains a great challenge for Timus coders, and the main difficulty is not to fit the speed limits. Vedernikoff Sergey (HSE: АОП) Re: Why TL such a large? [3] // Задача 1624. Go out of here! 18 мар 2009 21:21 Still, I think TL is too large. Now I wrote it and also got AC in 0.062 sec. I think that 1 sec. for this problem is more than enough... Al.Cash Re: Why TL such a large? [2] // Задача 1624. Go out of here! 2 май 2009 18:42 I agree because even obvious O(W*H*K) solution, written quite optimal, works less then 0.5 sec. Vedernikoff Sergey (HSE: АОП) Re: Why TL such a large? [1] // Задача 1624. Go out of here! 2 май 2009 22:43 Hm... This, IMHO, already means that testset is weak, and admins should try to improve it Sergey Lazarev (MSU Tashkent) Re: Why TL such a large? // Задача 1624. Go out of here! 29 авг 2009 17:36 I think it's strange to discuss large TL and weak tests for problem that was solved by 12 people on Timus (and one of them is the author of this problem). Sergey Lazarev (MSU TB) One question (+) [2] // Задача 1624. Go out of here! 2 июн 2009 01:53 What should my program output if every scout explored some part of the map (without any contradiction to himself), but there is no map that satisfies scout's "submaps" together? Vedernikoff Sergey (HSE: АОП) Re: One question (+) [1] // Задача 1624. Go out of here! 2 июн 2009 03:00 You are not asked about "submaps", but instead whether it is possible to construct a map with two given routes. So, as you see, your question is completely rhetorical. Sergey Lazarev (MSU TB) Re: One question (+) // Задача 1624. Go out of here! 2 июн 2009 20:22 Ok. 1) There aro two routes. 2) It's impossible to determine coordinates of at least one scout. 3) It's possible to construct map with the first route (without the second). 4) It's possible to construct map with the second route (without the first). 5) It's impossible to construct map with both routes together. What to output: "There is not enough data" or "A mistake has been made at step number X"? And (if the second case) how to determine X? Take maximal X?
|