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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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!