Getting wrong answer on test 2 for the following problem. 1633D - Make Them Equal
My Code 144774883 Please Help.
Getting wrong answer on test 2 for the following problem. 1633D - Make Them Equal
My Code 144774883 Please Help.
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 144 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
Auto comment: topic has been updated by asterisks (previous revision, new revision, compare).
I don't even understand properly your code, like there are many macros and that stuff but I'm pretty sure that there is no knapsack in there, and that was the intended way to solve it.
Your function for finding min no of opeartion to covert ('1' to 'm') is wrong . For m = 31 , you are getting minimum no of steps/operations as '7' but the minimum no of steps for m = '31' is '6' .
Edit :- Here is how you get 31 — [ 1 --> 2 --> 4 --> 8 --> 16 --> 21 --> 31 ] ( in 6 steps )
Can you give the right approach please?
You can use bfs to calculate minimum number of steps to reach B[i] from 1 or use an array to precalculate. I used an array.
You can precalculate this before test cases. Here is my submission
Link for codeforces