|
|
Страница 2 5 0 0 4 0 4 2 2 4 0 2 answer: 3.640719 Be careful, the input numbers are float, though sample and all tests here have only integer numbers. It appears first at <= 6th test. please give me some tests. Getting WA #9. My solution is bruteforce after dividing the lines I have got AC on this problem. In the description, it says "accuracy to 0.0001". In the code which I submitted, I use printf("%.4lf\n", min_breakage); to match the point. When I use the sample input, my output is 3.0000. But the sample output is 3. So I think the sample output may be wrong. Or both the two outputs are correct? I solved the problem geometrically in Microsoft VS C ++. At first, my solution was WA 8, but after I added 100 to the input coordinates, I started getting WA 38. But as I did not try to work with accuracy, I still got WA 38. I tried everything. Please tell me, is 38 test really drawn up correctly? Or at least tell me what my mistake is. I would like to see a test similar to 38. I am sure that I solved the problem correctly accuracy was most likely the problem for me I would like some tests, in particular test #3. Thank you. Please publish here some tests All test cases invented by me passed but I have got here WA on test 3 All tests have published here passes. Test 3 gives WA persistently. What is it like? I fixed 4 digits after decimal point of a result (that is, for example: 3.0000) Does it matter? Edited by author 02.07.2016 02:19 Edited by author 02.07.2016 02:19 4 0 0 1 0 0 1 -1 1 0.7071 3 0 0 1 0 0 1 0.6436 3 -1 0 1 0 0 1 0.9102 Thank you. But... C:\Casual\Task1058>task1058.exe <test12.txt 0.7071 C:\Casual\Task1058>task1058.exe <test13.txt 0.6436 C:\Casual\Task1058>task1058.exe <test14.txt 0.9102 I can hardly ever understand anything. My program cannot pass test #3. I try to solve different polygons that i feign myself. And everything is OK include some special cases like two equal points or all points in the same line. But when i try to submit solution test number 2 break all my hopes. What is the input data for test 2 and expected answer? thanks a lot I have same situation as author. Tried few different approaches - WA #2. Can we please have the data?) Thanks in advance Geometric solution I wrote has the same problem. With pass all of my own tests it got WA on test2. If it could be, please, give me test2 and output for it. Страница 1 My solution is geometrical, it passes all of my tests, except of one, where one side has a length of 0. But I got WA on test #2, so: 1) Can a polygon have a side with length of 0? 2) Can somebody give me any tests for this problem? 1) I'm pretty sure it can't, since otherwise my AC solution has a big chance to divide by zero. 2) 3 0 0 3 0 0 3 answer: 1.9308 Yeah, this is a pretty simple test but it actually helped me to overcome that WA #2. @Chitanda Eru, but 1.9308 aint correct. UPD: it is. Edited by author 30.09.2013 02:21 but N — the number of polygon vertices (4 ≤ N ≤ 50) Please, write there translated (RUSSIAN) version of this problem!!!! or you can send there for my adress daminus_corp@mail.ru > Thanks!!!! Вам даны координаты вершин полигона, надо найти такую линию, концы которой лежат на сторонах или вершинах многоугольника, что она разделит данный многоугольник на два равных по площади многоугольника. Whether the barycenter of the polygon is must on the break-line ? thanks ~ Old TL was set according to slow testing computer. Now more than half of AC solutions work in 0.1 sec and faster. So we decided to decrease TL to 1 sec. 10 authors lost AC. Problem 1058 WA @ Test #32! I supposed it to be the problem of precision. But, I don't know why...... Could somebody help me, for example, give me a test? Thx a lot. i got wrong ans in #9 . what is it? Edited by author 08.04.2008 22:41 87 authors lost AC after rejudge. Good luck! More tests were added. Read site news. test 4 was fixed, all submissions that had WA on test 4 has been rejudged. A lot of WAs turned to ACs! |
|
|