| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
my submission: https://codeforces.me/contest/2119/submission/327632426
My code fails on test 2's 1879th token. I do not understand whats wrong with it and how it fails at one particular point even though it seems fine to me. Lots of people failed this problem on test 2. Can someone tell me what's wrong with my code?
Thanks, Ramanav.
Why the first point?
usually, when it comes to some kind of computational geometry, I try to perform as many calculations as possible in integers, firstly they are faster, I'm not quite sure that I understand what is under the hood of real transformations, but there were many moments when I got TLE on them, I also find this option much more convenient, especially in this problem, where it is enough to square the remaining boundaries
FPE. Better to write like 15 more lines than to gamble AC by doing
sqrt().