| Show all threads Hide all threads Show all messages Hide all messages |
| Wrong constraint for test case #9 | cylau1996 | 1210. Kind Spirits | 13 Sep 2021 01:45 | 2 |
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. |
| WA #9 Useful Test | SergeyGlazkov [SPbPU] | 1210. Kind Spirits | 25 Jul 2019 06:56 | 1 |
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 |
| WA #5. Some tests is needed | Rakovets Alex | 1210. Kind Spirits | 23 Feb 2019 11:58 | 6 |
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 |
| WA #9 | Sunkyu Hwang | 1210. Kind Spirits | 23 Feb 2019 11:57 | 3 |
WA #9 Sunkyu Hwang 20 Feb 2017 10:47 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, Re: WA #9 Kondarattcev Denis [Ufa] 3 Nov 2017 19:18 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. |
| if wa2 | tishinilia | 1210. Kind Spirits | 1 Sep 2018 16:53 | 1 |
if wa2 tishinilia 1 Sep 2018 16:53 use max=10**9
maybe, i'm just silly |
| More test cases | azikar24 | 1210. Kind Spirits | 20 Feb 2018 00:09 | 1 |
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 |
| I think that it seems to be dp problem) | Alibi | 1210. Kind Spirits | 23 May 2015 07:34 | 2 |
|
| WA 5 :( | esraa.ali | 1210. Kind Spirits | 15 Sep 2014 05:41 | 1 |
WA 5 :( esraa.ali 15 Sep 2014 05:41 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! |
| For whom, who get WA 6 | Gleb_Kazantaev(NNSTU) | 1210. Kind Spirits | 22 Jul 2014 19:25 | 1 |
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 |
| WA #7 | chickenway | 1210. Kind Spirits | 6 Dec 2013 08:41 | 1 |
WA #7 chickenway 6 Dec 2013 08:41 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 |
| I agree with last orators, can somebody give #6 test? | AndrKonin | 1210. Kind Spirits | 16 Sep 2013 16:53 | 1 |
|
| WA on 6 test | R. Dubinin | 1210. Kind Spirits | 29 Jul 2013 23:51 | 1 |
please, give me some tests. |
| W.A. on the 6 test!!!! | Ivan | 1210. Kind Spirits | 16 Jul 2013 17:55 | 2 |
Give me sixth test, please!!! i also have WA on 6 test, please, give me some tests. |
| So what is test 6? - Runtime Error with C# | NeoTheFox | 1210. Kind Spirits | 3 Apr 2013 16:46 | 1 |
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? |
| Give me some tests | Duzhy Igor | 1210. Kind Spirits | 31 Dec 2009 23:43 | 3 |
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!!!!!!! | hisp | 1210. Kind Spirits | 30 Oct 2009 17:13 | 1 |
Why WA test#4 please Help me!!!!!!!
I used Deikstra and floida |
| Who has wrong answer 8 | Виктор Крупко | 1210. Kind Spirits | 26 Apr 2009 19:16 | 2 |
remember: That credits can be equal to zero
example:
1
2
1 12 0
1 0 0
answer 0 |
| The data may be wrong! | zhougelin | 1210. Kind Spirits | 15 Oct 2004 22:04 | 3 |
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. |
| Whot Name hase Fail | Slabac | 1210. Kind Spirits | 21 Sep 2004 02:48 | 1 |
My Proga is the good. But I don't know whot fail's name for this program. Help Me Please ANYBODY. |
| Any Idia? Help me please... | I am david. Tabo. | 1210. Kind Spirits | 23 May 2003 21:32 | 10 |
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! |
