|
|
Bugs fixed in the checker program. 1. The total length of dangerous segments was not always correctly verified against the canonical answer. Most prominently, the following output was previously accepted for the sample input (test 1), which has the total dangerous length 1.0 with the optimal one being 0.8: 2 1.0 1.5 0.0 1.5 2. Precision issues were fixed that were causing solutions with certain output rounding strategies being rejected (most commonly, WA8). The limitation on the number of pieces of furniture N was updated in the problem statements from N >= 0 to N >= 1 to reflect the actual test data. Additionally, the time limit was reduced from 2.0 sec to 1.0 sec. All solutions have been rejudged. 21 authors lost, and 2 other authors gained the Solved status for the problem. I've got AC My heap was so small...(Could anyone talls me why 400 is unenough?) Edited by author 22.09.2021 17:55 Is there any special test? Can the mouse go under the furniture? I mean, can it's way cross the polygons? I didn't solve it. But I think mouse CAN'T cross the polygon. If i think that mouse can go under furniture get WA3. If can't, get WA10 at the moment. So probably mouse can't go under furniture. I think it can't. I got WA3 if it can go under the furniture. But I got AC if it can't. Sorry,my English is very bad. Hi everybody, After a lot of testing I have wa21 ... Is there anything spacial about this test case ? Thanks in advance. Edited by author 18.07.2009 22:28 Yes, be sure you will not output more than 1000 vertices. Hint #1: The mouse or the cheese can be less than 10cm from the polygons Hint #2: Be careful of your first segment from the mouse or the last segment from the cheese. If you do not check correctly, they might cross a polygon. For example, think of the case of a very thin rectangle with the long side called A and a mouse that is less than 10cm from the rectangle. You have to make sure that the mouse runs to side A not the side opposite to A. Which is strange, since everything else is allowed in output. -0.5 0.5 1.5 0.5 1 4 0 0 1 1 0 1 1 0 0 0 3 0 1 3 1 50 1 -50 2 0 first test is incorrect. see : The furniture is a set of convex polygons. Here says nothing about order of vertices, so test is correct However, if I do not sort the vertex by angle, I don't lost AC Nevermind, I found my problem in the code. Edited by author 24.04.2010 02:55 Any help? Does someone here know the reason why so many people fail on test 8? 1) print 0 instead of -0 2) print 7 digits after decimal point 3) One can use Dijkstra over shortest segments between two polys ( without having to check for any intersections at all ). Is there anyone who can help me with test#13? I have passed all tests made by myself..but still wa8. (When my program was incorrect and with a lot of bugs..it began wa8... and now still... I always get WA on 15 Can anyone tell me why printing 4 or 5 or 6 fractional digits will all get wa on some test cases. but when i try to submit the programme with printing 7 fractional digits, i got ac...... Edited by author 03.09.2007 06:09 Thanks you a lot! I tried 4, 5, 6 digits but had WA#17, WA#21, WA#8 correspondingly. Strange, isn't it? After reading your post I tried 7 and got AC! I think there is problem with checker #input 0.0 0.0 2.0 0.0 0 #output 3 0.0 0.0 1.0 0.0 2.0 0.0 This output is correct, isn't it? |
|
|