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 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.net/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!