I was solving a problem 2119B - Line Segments and here is approach 336217184
What is wrong with this approach?
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
I was solving a problem 2119B - Line Segments and here is approach 336217184
What is wrong with this approach?
| Name |
|---|



imagine you have two moves: a = {10, 3}.
the farthest you can get from your starting point is by moving 10 units and then 3 units in the same direction, for a total distance of 10+3=13. the closest you can end up is by moving 10 units and then moving 3 units back in the opposite direction. the final distance would be 10-3=7.
you can reach any distance between 7 and 13, but you can never end up at a distance of, say, 5 from your starting point.
your code would incorrectly say "yes" for reaching a distance of 5, because sum = 13 which is >= 5