https://mirror.codeforces.com/problemset/problem/1915/G https://mirror.codeforces.com/contest/1915/submission/306582571
What am I missing?!
Any Help would be deeply appreciated!
https://mirror.codeforces.com/problemset/problem/1915/G https://mirror.codeforces.com/contest/1915/submission/306582571
What am I missing?!
Any Help would be deeply appreciated!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Maintain distance vector of n*1000 size like u maintained a visited vector .. Visited vector has no use , Link My submission for reference
2d distance vector
I appreciate,
But I would like to know, why my solution fails ?!
Any counter test case that you can think of ?!
See it like this speed and node are two changing parameters in priority queue so we need to memoise both of them .. Like a case where u reach a particular node but with a different bicycle ( u are using visited vector for that ..but it could be possible we are coming there with a better ans than before) .. another parameter slowness factor of bike is not accounted in ur distance vector
I think, but it could be possible we are coming there with a better ans than before seems wrong to me, as we are processing that node with that particular bicycle, then it is not possible to meet that node with the same bicycle and lesser distance.
And if it is even possible, my answer is lesser than jury, that's another puzzle.
It is possible that we visit the same node with same slowness ..but a better distance later
Why are u doing minimum slowness from 1 to i .. We have to take minimum as we push in queue
Any simple counter for my first statement, or a proof to counter it ?!
And I think you are getting 2 wrong.
I am not making a testcase now Consider u can arrive a node from two paths But first path u came actually had more distance and later path has less distance This actually happens in dijkstra right ?
But we can't come to that node when it is processed and removed out of the queue right. That is what my solution achieves using the vis 2D array.
I'm maybe opposing you too much, but I didn't get a concrete answer from ya, Don't get me wrong...Captain Cool.
?!