| ENG RUS | Timus Online Judge |
Обсуждение задачи 1775. Космический боулингandreyDagger`~ That's crazy // Задача 1775. Космический боулинг 28 сен 2023 00:35 #pragma GCC optimize("Ofast") With this line of code I'm getting AC 0.468, without it I'm getting TL14 ASK hint [1] // Задача 1775. Космический боулинг 1 апр 2018 01:37 For each pair of points, consider the family of lines parallel to the line that connects the points. Project all the points on the line perpendicular to the family, sort the coordinate, and find the smallest coordinate distance that covers k points. ASK Re: hint // Задача 1775. Космический боулинг 1 апр 2018 17:19 Note that since at least one line on the border must contain two points, instead of sorting one can use partition and nth_element. That is the time complexity does not need logarithm: O(n^3). TestKiller For those who get WA @ Test #16 [1] // Задача 1775. Космический боулинг 30 авг 2011 22:04 Test 16 contains the special case, where n = k = 1. The answer is obviously 0.000000. I don't understand why the author has put this special case on test 16, I didn't ever think, that it could be a special case. It rather costs me lots of time to debug. Ade [FDU] Re: For those who get WA @ Test #16 // Задача 1775. Космический боулинг 28 ноя 2014 22:25 thank you very much. Alexey Dergunov [Samara SAU] If you have WA 2 ... [1] // Задача 1775. Космический боулинг 7 авг 2012 23:05 ... then maybe you misread the statement: 1. Pins have diameter 1, not 0 2. You should output diameter of the ball, not radius Ade [FDU] Re: If you have WA 2 ... // Задача 1775. Космический боулинг 28 ноя 2014 22:19 Thank you! And it's really interesting that you know exactly how stupid I am. Edited by author 28.11.2014 22:25 Uros Joksimovic Can someone please give a hint for WA 21? :/ // Задача 1775. Космический боулинг 19 апр 2011 05:55 Edit: Found it, just print out the solution as fixed. E.g. cout<<fixed<<solution; Edited by author 19.04.2011 05:59 Dejan WA 4 [1] // Задача 1775. Космический боулинг 13 апр 2011 17:42 I have WA 4. Can somebody give me a hint about what's in this test case? Dejan Re: WA 4 // Задача 1775. Космический боулинг 19 апр 2011 00:06 Can someone help? kolufild WA Test #21 [1] // Задача 1775. Космический боулинг 14 апр 2011 19:24 Can I get any hint on how test 21 looks like, I'm going crazy with WA on that one... Uros Joksimovic Re: WA Test #21 // Задача 1775. Космический боулинг 18 апр 2011 05:10 I've got the same problem. :( Marginean Ciprian Help please! [1] // Задача 1775. Космический боулинг 16 апр 2011 00:27 Edited by author 16.04.2011 04:33 Tomislav Gudlek Re: Help please! // Задача 1775. Космический боулинг 16 апр 2011 02:30 Edited by author 16.04.2011 02:31 electroNik Sample test clarification [1] // Задача 1775. Космический боулинг 10 апр 2011 22:55 Can someone explain sample test? How come output is 1.00000000, when there is a pin at (3,0)? kolufild Re: Sample test clarification // Задача 1775. Космический боулинг 13 апр 2011 23:57 You don't have to hit all the pins, only k of them. In this example k is 4, and you hit all the pins except (3, 0). Yeah yeah wa2 =_= // Задача 1775. Космический боулинг 13 апр 2011 02:42 Im using the most stupid algo n^4 With special case m<=2 What`s the trick? Steven Oldrich WHAT ALGO??? // Задача 1775. Космический боулинг 9 апр 2011 04:38 Any hints on how to solve this problem?? KALO Java [2] // Задача 1775. Космический боулинг 8 апр 2011 19:00 Edited by author 09.04.2011 01:59 protonfan Re: Java [1] // Задача 1775. Космический боулинг 9 апр 2011 02:18 it seems easy :) Edited by author 09.04.2011 02:20 Steven Oldrich Re: Java // Задача 1775. Космический боулинг 9 апр 2011 04:38 Which algo to solve this problem?? Any hints plz Vedernikoff Sergey (HSE: АОП) Hint for those who have TLE [1] // Задача 1775. Космический боулинг 13 окт 2010 21:13 In the final loop, when you count the number of circles which the given line touches, use only + and * operations (without divisions and - OMG - square roots) - this will speed your code up several times. Edited by author 13.10.2010 21:13 Steven Oldrich Re: Hint for those who have TLE // Задача 1775. Космический боулинг 6 апр 2011 06:54 Throught what set of lines should i iterate?? Help pls olpetOdessaONU [1 2/3] Is there a faster algorithm? [2] // Задача 1775. Космический боулинг 17 окт 2010 12:05 I wrote a solution with complexity of O(n^3 log n) and got AC for 0.75 sec. Is there a solution for O(n^3) or O(n^2 log n)? Aleksandar Ivanovic Re: Is there a faster algorithm? [1] // Задача 1775. Космический боулинг 6 апр 2011 01:46 I have O ( N ^ 3 * LogN )and got AC for 0.234s, you can just optimize it. I can't think of a solution with better complexity. Steven Oldrich Re: Is there a faster algorithm? // Задача 1775. Космический боулинг 6 апр 2011 06:53 Have u used stabbing line problem variation? What algo have u used to solve this problem uP WA on Test 2 [3] // Задача 1775. Космический боулинг 9 окт 2010 20:12 Can anyone help me, I got WA on test 2 and don't understand why? PER (TUSUR) Re: WA on Test 2 [2] // Задача 1775. Космический боулинг 10 окт 2010 23:21 I got WA2 too...why?? Dirty Monk [SSU] Re: WA on Test 2 [1] // Задача 1775. Космический боулинг 11 окт 2010 12:51 Try this Test: 1 1 100 100 uP Re: WA on Test 2 // Задача 1775. Космический боулинг 11 окт 2010 14:21 is the result 0.000000000 right? Nizhny Novgorod SU No subject // Задача 1775. Космический боулинг 9 окт 2010 14:12 Edited by author 09.10.2010 14:34
|