| ENG RUS | Timus Online Judge |
Discussion of Problem 1305. Convex Hullkaifonaft WA 1!? [2] // Problem 1305. Convex Hull 26 Oct 2010 03:18 first test is not sample. Edited by author 26.10.2010 19:06 Alexander Fedulin Re: WA 1!? [1] // Problem 1305. Convex Hull 23 Jan 2011 21:11 The test has only one point. ASK Re: WA 1!? // Problem 1305. Convex Hull 18 Mar 2018 02:35 and it is far away from 0 keqidei Why wa#5? Help pls! // Problem 1305. Convex Hull 11 Nov 2015 17:17 Any one who can tell me why wa#5? pmartynov Not cellular solution // Problem 1305. Convex Hull 5 Apr 2014 20:33 Hey guys, I ACed with a cellular automata (a grid of 1000x1000 and a set of rules to transform 0s -> 1s). But is there any other(faster?) way to find a 45 convex hull given a set of points without a cellular automata? Alex Danilyuk [SESC USU Dandelion] KTC Some "minimal" cases... // Problem 1305. Convex Hull 23 Feb 2014 20:23 What should I do if the hull consist of one or two points? For example, test 1 1 1 Obviously, answer is 1 1 But these "three" points lie on one line. erfan O(n) // Problem 1305. Convex Hull 17 Sep 2013 00:18 I saw an algorithm of O(n) in http://irprogramming.ir but i could'nt understand it , can anyone explain ? Grebnov Ilya[Ivanovo SPU] Can somebody explain to me this problem? [3] // Problem 1305. Convex Hull 4 Sep 2004 16:53 What sequence of broken line’s vertexes should print my program? Give me some hints or tests. Dmitry 'Diman_YES' Kovalioff Of course, I can :) (+) [2] // Problem 1305. Convex Hull 4 Sep 2004 21:21 Just find a convex octagon of minimal area which satisfyes the following conditions: - all the points given are inside it or lay on it's borders - it's 2 sides are parallel to oX (-) - it's 2 sides are parallel to oY (|) - it's 2 sides are 45 degrees to oX (/) - it's 2 sides are -45 degrees to oX (\) And then output all the vertices of this figure. There could be 8 vertices, but some of them might be the same (some sides has zero length), so output them only once. So your output is from 1 till 8 vertices. Very easy statistical solution is O(N) time, O(1) memory. P.S. I will answer any your question - just mail me. chhung6 Re: Of course, I can :) (+) // Problem 1305. Convex Hull 2 Jul 2010 01:08 I can only understand the problem statement after reading this thread... Thanks so much! Hikmat Ahmedov Little correction // Problem 1305. Convex Hull 12 Mar 2013 16:48 Dmitry 'Diman_YES' Kovalioff wrote 4 September 2004 21:21 Just find a convex octagon of minimal area Area should not be minimal, the number of points inside convex polygon should be minimal, in other words, try so that more points lie on the boundary rather than inside the polygon. gaoshangbo 精度？？？？ // Problem 1305. Convex Hull 28 Sep 2011 07:33 = = Hanzbrow (TNU) KCC bad statement...hint // Problem 1305. Convex Hull 1 Aug 2009 23:07 I've never seen such a bad statement. if you have n points and you are asked to make a convex hull it is normal to think, that it can contain ONLY THESE points. hint: convex hull can contain any points, but number of vertices should be minimal as well as square) Denis Koshman Eeeh... Should it be convex? :) [2] // Problem 1305. Convex Hull 3 Aug 2008 16:57 I think yes, but it's not clear from problem statement despite the name of this set. [SPbSU ITMO] WiNGeR Re: Eeeh... Should it be convex? :) [1] // Problem 1305. Convex Hull 3 Aug 2008 22:10 In russian it is said: "Правильной выпуклой оболочкой множества M называется минимальное по включению выпуклое множество.." I think that english statement is wrong.. Sandro (USU) Fixed (-) // Problem 1305. Convex Hull 4 Aug 2008 00:40 Ignas Can anybody explain the problem? [1] // Problem 1305. Convex Hull 9 Apr 2004 22:15 Can you tell me if the required "well" convex hull can have points not from the set M? Thank you. Denis Koshman Re: Can anybody explain the problem? // Problem 1305. Convex Hull 3 Aug 2008 16:55 Yes, and generally it will Fechete Dan Ionut[dany] Can anybody explain this to me? [1] // Problem 1305. Convex Hull 7 Feb 2005 23:01 Well-formed convex hull of set M is minimal (relative to inclusion) set, containing M Denis Koshman Re: Can anybody explain this to me? // Problem 1305. Convex Hull 3 Aug 2008 16:55 Minimal area Edited by author 03.08.2008 16:55 Aleksa_Markoni Test resolt [1] // Problem 1305. Convex Hull 20 May 2008 13:56 Please can someone tell me what is the answer for this test: 8 1 3 2 2 3 1 4 2 5 3 4 4 3 5 2 4 gojiajunchao Re: Test resolt // Problem 1305. Convex Hull 7 Jul 2008 07:29 3.000000 5.000000 1.000000 3.000000 3.000000 1.000000 5.000000 3.000000 Crash_access_violation why wa#5? [1] // Problem 1305. Convex Hull 13 Feb 2008 21:00 I use Grakham algorithm and got WA#5... Please anyboby give me some tests... thanks... Aleksa_Markoni Re: why wa#5? // Problem 1305. Convex Hull 12 May 2008 23:21 Me too got WA#5... Can somebody help pls? I dont see the problem. Could it be vertecs on the same line. SPIRiT What does the term "minimal by inclusion" mean?(-) // Problem 1305. Convex Hull 11 Sep 2006 15:46 VALERO please give me some test... i think my program is right, but... // Problem 1305. Convex Hull 7 Aug 2006 19:53 i have wa on 3-rd test... If you can, tell me please how can i remember the first point? thank you... [code deleted] Edited by author 07.08.2006 19:54 Edited by moderator 08.08.2006 17:35 Yu Yuanming Something may help you // Problem 1305. Convex Hull 12 Jun 2005 12:35 Algo is O(n) The ans may not be more than 8 points,it is easy to see :) If all points on one line, I output the two ends of it. Maybe there isn't such test, because I think one line is not closed... At least, my pro got AC... Krayev Alexey(PSU#2) AAAAAAA!!!! At last!!!! I 've done it !!!. // Problem 1305. Convex Hull 1 Apr 2005 21:32 ABCDEFG Help,who can give me some tests? [2] // Problem 1305. Convex Hull 31 Oct 2004 16:35 sorry ,no problem now. Edited by author 31.10.2004 18:45 ABCDEFG Re: Help,who can give me some tests? [1] // Problem 1305. Convex Hull 31 Oct 2004 16:38 Is the coordinates integer or real? ABCDEFG Re: Help,who can give me some tests? // Problem 1305. Convex Hull 31 Oct 2004 18:43 Warning!!!!!!!!!!!!! Everybody who see this should notice that if there's only one vertex,you should output it's coordinate. Ronnie Tests // Problem 1305. Convex Hull 29 Aug 2004 04:16 Anyone knows where I can find the tests to this problem? I get WA #6. Edited by author 29.08.2004 12:53
|