| ENG RUS | Timus Online Judge |
Discussion of Problem 1170. DesertFaNato4kA_TiMoFeYa Wa 13 // Problem 1170. Desert 18 Aug 2024 22:55 Precision problem: try rounding intersection points or using epsilon when comparing points. Sirko Can rectangles be nested? [2] // Problem 1170. Desert 26 Feb 2015 04:25 Edited by author 26.02.2015 13:30 Sirko No subject // Problem 1170. Desert 26 Feb 2015 13:29 Edited by author 26.02.2015 13:30 ASK Re: Can rectangles be nested? // Problem 1170. Desert 24 Apr 2018 19:31 No, the problem statement makes no sense for nested rectangles. Sirko Question to solvers, authors (warn: spoiler) [1] // Problem 1170. Desert 3 Mar 2015 06:40 Can you guys provide me with a brief math proof that searched direction always contains at least one rectangles vertex (that is, no need to search for it between those rays made from vertexes coordinates)? Thanks. ASK Re: Question to solvers, authors (warn: spoiler) // Problem 1170. Desert 24 Apr 2018 19:30 In a small enough neighborhood of a line that does not pass thru one of the vertices, the distance traveled inside rectangle is smaller on one side and larger on the other, thus the distance on the line is not smaller/larger than in the neighborhood. Huang Yizheng Must the optimal line "L" pass at least one vertex of the N rectangles.If so,then how can improve it.If not,I find it's impossible to solve it. [3] // Problem 1170. Desert 18 Dec 2001 11:42 abc No, it needn't. If u are good at maths, u can solve it. [1] // Problem 1170. Desert 18 Dec 2001 12:15 Huang Yizheng Then how to solve it? // Problem 1170. Desert 18 Dec 2001 13:15 > ASK yes // Problem 1170. Desert 24 Apr 2018 19:20 Yes, there is an optimal line that passes thru one of the vertices (remember, that there are 4N vertices, not 2N :-) Sandro (USU) Problem 1170 "Desert" has been rejudged (+) [2] // Problem 1170. Desert 9 Sep 2010 10:55 Some bugs in the validator were fixed. The problem was rejudged. 299 WA submits turned to AC and 84 AC submits turned to WA. If you will find new bugs, please, write to timus_support (at) acm.timus.ru. Edited by author 09.09.2010 10:57 198808xc Re: Problem 1170 "Desert" has been rejudged (+) [1] // Problem 1170. Desert 9 Sep 2010 21:11 To those who have WA at 2 after rejudge: The ending point MUST have positive (STRICTLY) coordinates. Try this testcase: 1 1 1 2 2 4 2 3 to see if your answer satisfies the condition. c_pp Re: Problem 1170 "Desert" has been rejudged (+) // Problem 1170. Desert 14 Jan 2017 02:30 Thx a LOOOOT of @198808xc. I got AC . if c0 less than all of other delay times: x = 0.003 ; y = sqrt(L*L - x*x) xurshid_n ToAdmin: Same code AC in G++ 4.9, BUT WA2 in VS2013, G++ 4.9 C++11, Clang C++14 // Problem 1170. Desert 14 Jan 2017 02:01 svr right or wrong? 1170-desert [6] // Problem 1170. Desert 21 Nov 2007 14:12 Right or wrong my answer to the next test? 10 1 1 2 2 3 10 1 11 2 1 5 5 6 7 2 3 4 8 7 3 1 3 9 9 3 12 11 15 12 1 3 3 6 6 2 4 6 8 10 3 3 7 4 12 3 2 5 4 7 2 4 50 rez: 107.071068 35.355339 35.355339 and this one: 10 1 1 2 2 8 10 1 11 2 1 5 5 6 7 2 3 4 8 7 3 1 3 9 9 3 12 11 15 12 6 3 3 6 6 5 4 6 8 10 3 3 7 4 12 3 2 5 4 7 2 4 50 rez: 153.263903 19.695965 45.957252 Edited by author 21.11.2007 14:15 Edited by author 15.03.2008 10:46 Edited by author 15.03.2008 10:49 AlexF [USTU Frogs] Re: right or wrong? 1170-desert [4] // Problem 1170. Desert 21 Nov 2007 18:16 On the first test my AC prog gives 179.034852 36.857707 33.786231 On the second case 191.055728 22.360680 44.721360 svr Re: right or wrong? 1170-desert [1] // Problem 1170. Desert 21 Nov 2007 20:36 Thanks very very much! AlexF [USTU Frogs] Re: right or wrong? 1170-desert // Problem 1170. Desert 21 Nov 2007 23:30 Good Luck)) 198808xc Your answer is NOT correct!!! [1] // Problem 1170. Desert 18 Aug 2008 17:31 Your angle is correct, but the time delay is NOT. My AC programme said that time delay is: 1. 171.265415 2. 184.347524 Good luck~ данные Re: Your answer is NOT correct!!! // Problem 1170. Desert 13 Feb 2009 20:05 My AC program got the same answer as 198808xc. Sirko Re: right or wrong? 1170-desert // Problem 1170. Desert 3 Mar 2015 06:44 Given tests contain nested/overlaped rectangles. And original tests dont (problem statement is not clear enough concerning this, though). Hence, different AC solutions may return different result, these tests don't make sense. Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) Interesting (+) [1] // Problem 1170. Desert 28 May 2007 00:26 I SUBMIT MY SOLLUTION: [code deleted] AND GET WA1. NEXT I COMMENT "_y1<=a2[i].y" AT LINE XXX AND "_y2>=a1[i].y" AT LINE XXX AND SUBMIT: [code deleted] AND GET AC!!!! Edited by author 28.05.2007 00:53 Dart MirzMan C++ Edition (Mirzoyan Alexey, Rybinsk SAAT) Re: Interesting (+) // Problem 1170. Desert 28 May 2007 00:56 Oh, I have understood... Really, both my sollutions was wrong...) mmmmmm So fun // Problem 1170. Desert 20 Jan 2007 14:26 My pro in pascal got wrong but not in C++. so fun !!!!!!!!! Neumann maths problem // Problem 1170. Desert 4 Mar 2005 10:44 the code is trivial......but the proof is a little hard...... I thought out the algo early before,but I don't know whether it is right......it puzzles me......now,I have proved it!:) hint: put the intersects into four cases for thought... awts Who can give me some test datas?I got WA.:( // Problem 1170. Desert 27 May 2003 17:47 Huang Yizheng Thanks for abc's help,I improved my program got accepted in 0.03sec. // Problem 1170. Desert 29 Dec 2001 12:43 Huang Yizheng This problem is rather hard.Anybody who have difficulty in this problem can email to "hyz12345678@163.com". // Problem 1170. Desert 22 Dec 2001 08:36
|