|
|
using binary search r, and check for each segment,find the inner side part of other segment that distance is smaller than 2*r,get the segment of these points in each line, check if union of them is the hole line segment. for check two segments' distance we only need to check innerside adjctent two line segments it can be done by O(n*log(n)) sweepline precalculate.. admin please set another version with n<=100000. Why wa26?) Tests help me to pass test 2 and test 3. 9 1 -1 2 1 1 0 2 2 0 1 -2 2 -1 0 -2 1 -1 -1 1.00 12 2 1 1 1 1 2 -1 2 -1 1 -2 1 -2 -1 -1 -1 -1 -2 1 -2 1 -1 2 -1 1.41 AC 6 0 0 0 -3 1 -2 2 -2 3 -3 3 0 1.00 Test help me ThankU for the tests, they were useful to me, but I still having WA on test 15, any help will be apreciated. AC again with nearly nothing change Admins, do you check timus_support@acm.timus.ru from time to time? My solution to this problem just lacks 1/3 of a solution (actually, the most difficult third of it) - and got AC! I sent the code recognizing that important part of the solution is missing and just wanted to see how far it will reach - but got AC instead. Pity that such a good problem has such a weak testset. I can mail my tests to you, but it seems nobody checks this mailbox... Edited by author 16.08.2014 13:34 up up Edited by author 04.08.2014 02:20 up up Tests have been added. 16 authors have lost AC. I've found out that there's a triangle in this test. My program is likely to find the center of inscribed circle correctly, so I don't understand where is the mistake. Can somebody give me more information to pass this test? та же проблема с wrong answer #2 Give me some tests, please. Precision of 1e-8 is ok to get AC (provided that you use only square roots, no trigonomety). I got AC using sin, cos broadly. Извиняюсь, что на русском, но английский знаю плохо. В условии задачи на русском языке ошибка - "Тёмыч выгуливает своего любимого козла..." и "...число R — длину веревки, на которую Вася привяжет козла..." |
|
|