| ENG RUS | Timus Online Judge |
Discussion of Problem 1504. Good Manners8848mzy How to solve it in less one second [2] // Problem 1504. Good Manners 31 Oct 2006 06:07 rt Denis Koshman Re: How to solve it in less one second [1] // Problem 1504. Good Manners 30 Aug 2008 16:31 Voroni diagrams perhaps (O(N*log(N)) gerind Re: How to solve it in less one second // Problem 1504. Good Manners 15 Apr 2024 20:02 I have AC 0.046s, O(K^3) with very simple approach Vladimir Yakovlev (USU) Changes for 1504 "Good Manners" (+) [5] // Problem 1504. Good Manners 30 Oct 2006 14:14 Problem statement was updated: • "All the pieces have distinct coordinates and lie on a table" • "Coordinates should be precise up to 7 digits" New tests have been added. Timelimit was decreased to 3 seconds. Submissions made after contest have been rejudged. This problem suppose O(N^2) solution now. [SPbSU ITMO] WiNGeR Re: Changes for 1504 "Good Manners" (+) [4] // Problem 1504. Good Manners 7 Nov 2006 03:36 I think there is an O(NlogN) solution Vedernikoff Sergey Re: Changes for 1504 "Good Manners" (+) // Problem 1504. Good Manners 9 Nov 2006 14:41 I also think so... Sid Re: Changes for 1504 "Good Manners" (+) [2] // Problem 1504. Good Manners 22 Nov 2006 23:07 But how??? I solved this problem using quadro trees. My solution is about O(N^2*log(N)). What is O(N^2) or O(Nlog(N)) algo? EfremovAleksei Re: Changes for 1504 "Good Manners" (+) [1] // Problem 1504. Good Manners 22 Dec 2006 21:40 Diagram of Voronoy - is O(n*log(n)) Vit Demidenko Re: Changes for 1504 "Good Manners" (+) // Problem 1504. Good Manners 5 Jan 2012 13:32 O(n^3) is also acceptable, but it seems to be O(n^2) Edited by author 06.01.2012 03:13 Sabbir Yousuf Sanny Problem G: precisions [2] // Problem 1504. Good Manners 28 Oct 2006 17:57 How many digits after the decimal point should we output? mahbubul Re: Problem G: precisions [1] // Problem 1504. Good Manners 29 Oct 2006 10:35 sanny vi, i have printed with %lf a6687543 Re: Problem G: precisions // Problem 1504. Good Manners 10 Nov 2011 11:21 %.7lf is correct Cat36 WA4 [1] // Problem 1504. Good Manners 11 May 2009 08:20 What is it? Marshall Mathers Re: WA4 // Problem 1504. Good Manners 17 May 2011 14:19 GU Yizheng knows it. xiaomengxian I get Wrong Answer at #28 [1] // Problem 1504. Good Manners 15 Mar 2007 11:49 My algorithm is to consider every cake A from big to small to check whether Vovan can get. If Vovan wants to get cake A rather than B, he position must be in a certain arc in the cirlce, and the common part of these arcs is the available position. If the common part exists, then there is a solution that Vovan can get cake A. I've checked my program for many times, but I don't know why I get Wrong Answer at #28. Please help me~ Edited by author 15.03.2007 11:59 xiaomengxian Re: I get Wrong Answer at #28 // Problem 1504. Good Manners 15 Mar 2007 12:03 I get Accepted.... I got WA because of the precision problem... Ostap Korkuna (LNU) To Authors! The tests are very simple!!! [3] // Problem 1504. Good Manners 30 Oct 2006 00:09 I think the tests for this problem are very simple!!! Here is the solution, which gets AC: I just divide the [-R; R] into 10 (!!!! only 10 !!!!!) parts and for every X from those 10 (!!!) values I calculate two corresponding Y => I get 20 points => calculate the nearest piece for every point and output the one with the biggest piece. Isn't it to simple??? _I_ Re: To Authors! The tests are very simple!!! [2] // Problem 1504. Good Manners 2 Nov 2006 03:42 i did what you said, but got WA, i also divided the interval into 100 parts also getting WA could you explain clearly Vedernikoff Sergey Re: To Authors! The tests are very simple!!! [1] // Problem 1504. Good Manners 2 Nov 2006 16:13 I think, now the above solution is incorrect... Ostap Korkuna (LNU) Re: To Authors! The tests are very simple!!! // Problem 1504. Good Manners 6 Nov 2006 19:22 Of course this solution gets WA now. Admins added new tests... Vasyl Biletskyy (Lviv NU) To admins: Interesting... [1] // Problem 1504. Good Manners 30 Oct 2006 23:12 Interesting why this code gets Crash(2) if it is said that k <= 1000 ???? #include <stdio.h> int main() { int k, r; scanf("%d%d", &r, &k); if(k > 1000) throw 0; else printf("6 8\n"); return 0; } Vasyl Biletskyy (Lviv NU) Re: To admins: Interesting... // Problem 1504. Good Manners 30 Oct 2006 23:16 Sorry, I've found my mistake - R is not integer. BUT it is not clear from problem statement... N.M.Hieu ( DHSP ) Can you tell me why ? [1] // Problem 1504. Good Manners 29 Oct 2006 16:39 I saw in the best solutions that there were some programs worked longer than 0.25s . Why could they get AC ? Safe Bird Re: Can you tell me why ? // Problem 1504. Good Manners 29 Oct 2006 17:34 Checker sucks really.
|