how to solve this problem??
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
how to solve this problem??
Name |
---|
You can do this by binary searching the answer which is checked valid by:
1.making a graph with cost sqrt(|x_j-x_i-L|) — R * b_j and always x_j > x_i.
2.In this graph,find shortest path from x0 to xn (take x0 as a dummy start).
3.Once you get the optimal value you backtrace the waiting pts you took.
For further reading Editorial's comment
His submission for this method Submission
EDIT:Congrats for becoming the Training and Placement Representative
What is R? and why is the cost taken as sqrt(|x_j-x_i-L|) — R * b_j
u can call it the present value in the binary search or mid.