| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
PROBLEM : 1538C - Number of Pairs
119286813 -> my submission
119286794 -> some guy's java submission which got accepted
I fail to understand why my submission is failing when is has the exact same logic as the submission which got accepted.
I tried to make it work, but nothing seems to work.
I guess i'll have to say fuck off to java and use C++, because this is just demoralizing.
Arrays.sort() can be n^2 if you make the right test case.
Well, then why did the second submission get accepted? Both of them used Arrays.sort()
Arrays.sort() for primitives uses quick sort which is O(n^2) worst case. For array of objects (in this case Long[]), Arrays.sort() uses merge sort which is O(nlogn) worst case.