| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| WA#25 any hints? | zwqzwq | 1199. Мышка | 22 сен 2021 17:21 | 2 |
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? |
| a question | LX&R Bacherikov | 1199. Мышка | 12 авг 2021 06:42 | 4 |
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. |
| 600 lines of code to get wa21 :( | Martin_fmi | 1199. Мышка | 3 дек 2017 20:28 | 4 |
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. |
| WA #30 Any hints? | Baruvka | 1199. Мышка | 12 май 2014 23:24 | 2 |
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. |
| If two consecutive points in your output coincide, you get WA. | crdp | 1199. Мышка | 21 апр 2013 20:22 | 1 |
Which is strange, since everything else is allowed in output. |
| some tests | Erop [USU] | 1199. Мышка | 19 апр 2012 15:14 | 3 |
-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 |
| Question: Example test | Florin Pogocsan | 1199. Мышка | 23 апр 2010 18:00 | 1 |
Nevermind, I found my problem in the code.
Edited by author 24.04.2010 02:55 |
| WA8 | Tomislav Gudlek | 1199. Мышка | 13 апр 2010 00:54 | 2 |
WA8 Tomislav Gudlek 8 апр 2010 21:21 Re: WA8 Mislav Balunović 13 апр 2010 00:54 Does someone here know the reason why so many people fail on test 8? |
| Some hints | Martin_fmi | 1199. Мышка | 21 июл 2009 05:41 | 1 |
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 ). |
| Test 13 WA | EarthShaker | 1199. Мышка | 23 мар 2009 06:58 | 1 |
Is there anyone who can help me with test#13? |
| I want to know test8...or who give me some tests.. | данные | 1199. Мышка | 9 мар 2009 16:36 | 2 |
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... |
| Why wa 15?????????????????????? | dejiyu | 1199. Мышка | 18 дек 2008 17:53 | 1 |
I always get WA on 15
Can anyone tell me why |
| it's so faint | yuhch | 1199. Мышка | 10 авг 2008 19:49 | 3 |
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 |
| a question | {AESC USU} Dembel | 1199. Мышка | 29 янв 2008 21:23 | 1 |
#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? |
| New problem is available to solve! 1199 "Mouse" (-) | Vladimir Yakovlev (USU) | 1199. Мышка | 31 дек 2006 01:11 | 1 |
|
