Show all threads Hide all threads Show all messages Hide all messages 
Hint  OpenGL  1514. National Park  28 Dec 2020 19:50  2 
Hint OpenGL 3 Aug 2009 20:02 If you got TLE on test>28, try this test 50000 0 0 0 0 ... 50000 points (0,0) 0 0 Re: Hint Md sabbir Rahman 28 Dec 2020 19:50 Thanks man, that really helped 
help me with case 8  iakwal  1514. National Park  18 Aug 2018 14:30  1 
what is case 8 like,i just can't solve it with divede and conquer... 
If there is three equal points than perimeter equals zero? []  NotImplemented  1514. National Park  27 Nov 2015 01:33  3 
If there is three equal points than perimeter equals zero? Something strange: if three points with equal coordinates than output zero. > WA6 if four points with equal coordinates than output zero. > AC This made me crazy. Can somebody clarify? I have the same trouble. Maybe something wrong with test or checker? 
What i must know to solve it?  EfremovAleksei  1514. National Park  19 Oct 2013 00:50  2 

Test 16  Victor Barinov (TNU)  1514. National Park  6 Jun 2013 10:56  2 
Test 16 Victor Barinov (TNU) 11 Jul 2008 02:11 If you have WA on 16 test than maybe you have error in calculation of (xi  xj)^2. See problem statement xi < 10^6 so (xixj)^2 may be 4*10^12 and it does not fit in int type. Thanks a lot indeed! This is just where I've been confused with and your tips are really helpful! 
Who can send on my email AC solution?  OpenGL  1514. National Park  3 Aug 2009 19:57  1 
I got AC on this problem with 0.14 sec and 6400 kb memory. But most people submitted problem with 1 Mb memory. Who can send on email void438@inbox.ru solution with less memory and time? 
yeah, fun  Alexander Kouprin  1514. National Park  3 Aug 2009 17:42  1 
nothing here Edited by author 03.08.2009 18:22 
Hint:  N.M.Hieu ( DHSP )  1514. National Park  25 Oct 2008 02:01  1 
Hint: N.M.Hieu ( DHSP ) 25 Oct 2008 02:01 Try some kind of "divide and conquer" algorithm. My algorithm is based on the algorithm of finding the closest pair of points, used the same pruning. Believe me, what you think is impossible this time it's possible. 
Can you give a hint on how to solve this problem?  Hao Hu (Ikki @ Nanjing University)  1514. National Park  28 Mar 2007 14:48  4 
I was thinking of using Voronoi Diagram or Delaunay Triangulation to solve it.... Are U crazy? On ACM problems? 
WA16 What is special in this test? i can't find the bug in my prog  Alias (Alexander Prudaev)  1514. National Park  18 Feb 2007 00:26  7 
i have write bruteforce procedure solve() and test my program on random tests. my program always gives correct answer. I have not so twisted imagination, which have autors this tests, so i can't think up such test. My congratulations to autors: your imagination is more twisted than rand() :) Your should be greatful to authors who keep in secret speeding up methods and give you(and us) chance to create them. Now I can't see how avoid O(n^3) For example may be 16000 smal identical triangles and so on. I think 15test is last with small N. So nottopcoders may move to solution by exchanging with ideas on forum. Edited by author 17.02.2007 22:04 to SVR Alias (Alexander Prudaev) 17 Feb 2007 22:09 Why in this case you use use brute force and random? Re: to SVR Alias (Alexander Prudaev) 17 Feb 2007 23:11 because my NlogN solution gives wrong answer on 16th test and i tryed to find such test, that BruteForce answer differs with MyNlogNSolution answer Try to prove your algorithm. If proof right and authors is'n mistaken you will pass test 16 without difficulties. 
WA #1! Is it a joke? (+)  Vedernikoff Sergey  1514. National Park  29 Jan 2007 14:59  3 
Or test #1 is not a sample? Or compiler bug, as usual? Oh, I'm sorry... I submitted solution of other problem  AC now... Edited by author 29.01.2007 15:22 
What does "Wrong answer on Test # 16" mean?  Hao Hu (Ikki @ Nanjing University)  1514. National Park  25 Dec 2006 15:01  2 
If my program gets WA on test# 16, does it mean that it is accepted for(i=1;i<=15;i++) test# i? (no wrong answer, memory limit ok, no stack overflow, everything all right)? It means, that your program passed first 15 tests successfully, but got WA on test #16. So, the problem is not solved... 
Can you give me a hint on test case #17?  Hao Hu (Ikki @ Nanjing University)  1514. National Park  24 Dec 2006 12:43  1 
I got TLE on test #17, but it didn't use too much memory, what is the problem...? If the number of points is very big then it should use a large amount of memory ...@_@ 
Do I have to use nonrecursive program to pass this problem?  Hao Hu (Ikki @ Nanjing University)  1514. National Park  24 Dec 2006 11:54  1 
My divideandconquer algorithm failed on test case #16 @_@ 