I was solving a problem 2119B - Line Segments and here is approach 336217184
What is wrong with this approach?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
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
thank you for clarification.