| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
I was solving 1684D - Traps of recent contest and have faced with strange thing.
Pls look at two pairs of submissions. (There are very simple code)
In both pairs codes' difference is the same: 'wrong' submission uses lambda function with operator >= instead of > in 'good' submission.
Can it be explained?
i suppose (i'm not sure of course), that sorting with operator >= is bad because comparator can swap equal elements infinitely (sounds a bit crazy, but seems like there are not other reasons for RE and TL)
https://mirror.codeforces.com/blog/entry/70237
Thank you.
if comparator returns true for (a, b) it should return false for (b, a). otherwise it's undefined behavior
Thank you.