At the end of the contest, my submission for this problem gave me a runtime error on case 19. This program solved larger cases of this problem but apparently not this one. Does anyone know why this happened? Here is the submission
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
At the end of the contest, my submission for this problem gave me a runtime error on case 19. This program solved larger cases of this problem but apparently not this one. Does anyone know why this happened? Here is the submission
Name |
---|
Your sorting function is causing the RE. Write "return(a.money<b.money);" inside it instead. Got AC: http://codeforces.com/contest/580/submission/13172132
To further exaplain, imagine you have three friends all with 5 money, X,Y and Z. Your function would say that X>Y, Y>Z, and Z>X. This will mean that the sort will keep sorting on and on forever, trying to get it right, but it never will because X can be greater or smaller than Y depending if it is the a parameter or b parameter.
If you set n=d=1000 and v[i].money=v[i].friendship=123 it will throw the exception.
Oh, I see now. Thank you very much!