| ENG RUS | Timus Online Judge |
Обсуждение задачи 1514. Национальный паркOpenGL Hint [1] // Задача 1514. Национальный парк 3 авг 2009 20:02 If you got TLE on test>28, try this test 50000 0 0 0 0 ... 50000 points (0,0) 0 0 Md sabbir Rahman Re: Hint // Задача 1514. Национальный парк 28 дек 2020 19:50 Thanks man, that really helped iakwal help me with case 8 // Задача 1514. Национальный парк 18 авг 2018 14:30 what is case 8 like,i just can't solve it with divede and conquer... NotImplemented If there is three equal points than perimeter equals zero? [-] [2] // Задача 1514. Национальный парк 24 янв 2014 00:43 If there is three equal points than perimeter equals zero? NotImplemented Re: If there is three equal points than perimeter equals zero? [-] [1] // Задача 1514. Национальный парк 24 янв 2014 00:49 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? ACNeed Re: If there is three equal points than perimeter equals zero? [-] // Задача 1514. Национальный парк 27 ноя 2015 01:33 I have the same trouble. Maybe something wrong with test or checker? EfremovAleksei What i must know to solve it? [1] // Задача 1514. Национальный парк 21 дек 2006 23:01 IgorKoval [PskovSU] Re: What i must know to solve it? // Задача 1514. Национальный парк 19 окт 2013 00:50 Victor Barinov (TNU) Test 16 [1] // Задача 1514. Национальный парк 11 июл 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 (xi-xj)^2 may be 4*10^12 and it does not fit in int type. jollwish Re: Test 16 // Задача 1514. Национальный парк 6 июн 2013 10:56 Thanks a lot indeed! This is just where I've been confused with and your tips are really helpful! OpenGL Who can send on my e-mail AC solution? // Задача 1514. Национальный парк 3 авг 2009 19:57 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 e-mail void438@inbox.ru solution with less memory and time? Alexander Kouprin yeah, fun // Задача 1514. Национальный парк 3 авг 2009 17:42 nothing here Edited by author 03.08.2009 18:22 N.M.Hieu ( DHSP ) Hint: // Задача 1514. Национальный парк 25 окт 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. Hao Hu (Ikki @ Nanjing University) Can you give a hint on how to solve this problem? [3] // Задача 1514. Национальный парк 23 дек 2006 14:44 Thanks...:) Kit Learn something about "divide and conquer" method. (-) [2] // Задача 1514. Национальный парк 23 дек 2006 17:43 Hao Hu (Ikki @ Nanjing University) Thanks for your hint. [1] // Задача 1514. Национальный парк 23 дек 2006 17:56 I was thinking of using Voronoi Diagram or Delaunay Triangulation to solve it.... PSV Re: Thanks for your hint. // Задача 1514. Национальный парк 28 мар 2007 14:48 Are U crazy? On ACM problems? Alias (Alexander Prudaev) WA16 What is special in this test? i can't find the bug in my prog [6] // Задача 1514. Национальный парк 17 фев 2007 20:52 Alias (Alexander Prudaev) please help me! [5] // Задача 1514. Национальный парк 17 фев 2007 21:49 i have write brute-force 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() :) svr Re: please help me! [4] // Задача 1514. Национальный парк 17 фев 2007 22:04 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 15-test is last with small N. So not-top-coders may move to solution by exchanging with ideas on forum. Edited by author 17.02.2007 22:04 Alias (Alexander Prudaev) to SVR [3] // Задача 1514. Национальный парк 17 фев 2007 22:09 there is NlogN solution svr Re: to SVR [2] // Задача 1514. Национальный парк 17 фев 2007 22:17 Why in this case you use use brute force and random? Alias (Alexander Prudaev) Re: to SVR [1] // Задача 1514. Национальный парк 17 фев 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 svr Re: to SVR // Задача 1514. Национальный парк 18 фев 2007 00:26 Try to prove your algorithm. If proof right and authors is'n mistaken you will pass test 16 without difficulties. Vedernikoff Sergey WA #1! Is it a joke? (+) [2] // Задача 1514. Национальный парк 27 янв 2007 17:43 Or test #1 is not a sample? Or compiler bug, as usual? Dmitry 'Diman_YES' Kovalioff The first test is the sample in all Timus Top Coders problems (-) [1] // Задача 1514. Национальный парк 27 янв 2007 20:37 Vedernikoff Sergey Re: The first test is the sample in all Timus Top Coders problems (-) // Задача 1514. Национальный парк 29 янв 2007 14:59 Oh, I'm sorry... I submitted solution of other problem - AC now... Edited by author 29.01.2007 15:22 Hao Hu (Ikki @ Nanjing University) What does "Wrong answer on Test # 16" mean? [1] // Задача 1514. Национальный парк 24 дек 2006 12:24 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)? Vedernikoff Sergey Re: What does "Wrong answer on Test # 16" mean? // Задача 1514. Национальный парк 25 дек 2006 15:01 It means, that your program passed first 15 tests successfully, but got WA on test #16. So, the problem is not solved... Hao Hu (Ikki @ Nanjing University) Can you give me a hint on test case #17? // Задача 1514. Национальный парк 24 дек 2006 12:43 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 ...@_@ Hao Hu (Ikki @ Nanjing University) Do I have to use non-recursive program to pass this problem? // Задача 1514. Национальный парк 24 дек 2006 11:54 My divide-and-conquer algorithm failed on test case #16 @_@
|