|
|
The question stated that 0 < N < 30. However, in test case #9 N is exactly 30, contradicting the constraint. The test has been fixed. The solutions have been rejudged, making some solutions submitted before adding this test rejected and some submitted after adding it accepted. If you have WA #9 try this: 4 1 1 32300 0 * 1 1 32300 0 * 1 1 32300 0 * 1 1 32300 0 answer: 129200 I`m sure that written algo is correct, but I might make stupid mistake... My solutions can pass all my tests and my friends` also. Please, give me some tricky tests! Thanks a lot! 2 2 0 1 2 0 * 2 1 1 0 2 3 0 answer 5 Here are some tests: TEST : 10 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 * 1 1 10 0 answer 100 TEST: 1 3 1 10 0 2 -5 0 3 -1000 0 answer -1000 Here are some tests: TEST: 1 3 1 10 0 2 -5 0 3 -1000 0 answer -1000 I think this test is wrong, because we have only 1 planet on the 0th level, So it should be: 1 3 1 10 0 1 -5 0 1 -1000 0 I keep getting non-zero return from WA #9 (meaning some of my scanf() fails) Could you please forward WA #9 problem so that I can check parsing is proper? Thank you, Test #9 probably contains upper limit case, when there are max possible levels with max planets in each, I can suggest you to check your array sizes. I also got WA #9 after setting wrong integer value for "unreachable" planets - I've set it too small and it affected the result at this test You're right... After changing the values to a higher value for the unreachable nodes, I got AC. Thanks. use max=10**9 maybe, i'm just silly Make sure your graph is more than 1296 and try these 3 2 1 2 0 1 5 0 * 3 1 8 2 3 0 1 -5 0 2 25 0 * 2 1 8 2 22 3 -15 0 2 19 3 -50 0 ans = -20 =========================== 4 2 1 2 0 1 5 0 * 4 1 8 2 3 0 1 -5 0 2 25 0 1 22 2 -3 0 * 3 1 8 2 22 3 -15 0 2 19 3 -50 0 4 -1 2 -5 0 * 4 1 -8 2 18 0 1 -5 0 2 -19 3 -22 0 1 12 0 ans= -39 ============================== 2 2 1 2 0 1 5 0 * 4 1 8 2 3 0 1 -5 0 2 25 0 1 22 2 -3 0 ans = -3 ========================== 4 2 1 2 0 1 5 0 * 4 1 81 2 23 0 1 56 0 2 25 0 1 22 2 -31 0 * 3 1 8 2 22 3 -15 0 2 19 3 -50 0 4 -1 2 -5 0 * 4 1 82 2 18 0 1 59 0 2 39 3 52 0 1 112 0 ans = -2 can i have test 5 please I`m sure that my solution is correct, but I have WA on 5 test... My solutions can pass all the tests shown Please, give me test 5 ,or some tricky tests! Thanks a lot! If u used Dijkstra alg, u should add min price for all pices, and theh deduct it from unswer multiplying on count of the tops. Sorry for my eng :D I'm wrong with test 7, can someone give me some test? Thanks. Edited by author 06.12.2013 09:29 Edited by author 06.12.2013 09:29 please, give me some tests. Give me sixth test, please!!! i also have WA on 6 test, please, give me some tests. I dont know if it is my mistake or difference between Mono and Microsoft C#, but it fails at test 6 with runtime error. Is there a way I can know what test 6 is? I think that my program is correct, but i don't understand why i have WA#5. I use Dejkstra algorithm. Please, give me some right tests. Than I use another method - DP. I use 2 arrays for the current and previous states, but I have WA#7. Help!!! Thanks. Edited by author 06.10.2006 22:31 Edited by author 06.10.2006 22:31 Edited by author 06.10.2006 22:31 As i know - Dejkstra dosn't work for graph with negative weight of edge. 3 2 1 15 0 1 5 0 * 4 1 -5 2 10 0 1 3 0 2 40 0 0 * 3 1 1 2 5 3 -5 0 2 -19 3 -20 0 4 -100 0 Answer is -1 Why WA test#4 please Help me!!!!!!! I used Deikstra and floida remember: That credits can be equal to zero example: 1 2 1 12 0 1 0 0 answer 0 as the title But is not! (not at any porblem since all problems are solved) Edited by author 26.09.2004 23:18 Edited by author 26.09.2004 23:19 What can be wrong, do you mean the line break?? I use read and then 2 readln before go to next level , that is all. My Proga is the good. But I don't know whot fail's name for this program. Help Me Please ANYBODY. > If one doesn't know english well enough it isn't a reason to laugh. Just be more indulgent... > If one doesn't know english well enough it isn't a reason to laugh. > Just be more indulgent... > > If one doesn't know english well enough it isn't a reason to laugh. > > Just be more indulgent... > > > If one doesn't know english well enough it isn't a reason to > laugh. > > > Just be more indulgent... You just need two arrays: one for the current level and one for the level before. Just put in the array the best way to get that point. Hope this helps! |
|
|