Hi everyone, I'm trying to solve 316E3 - Задание на лето. Despite reading the tutorial link, I could't understand clearly the solution. Could you explain me more detail??
# | 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 | awoo | 163 |
2 | adamant | 161 |
2 | maomao90 | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Hi everyone, I'm trying to solve 316E3 - Задание на лето. Despite reading the tutorial link, I could't understand clearly the solution. Could you explain me more detail??
Name |
---|
The key is the merging step
While merging
and
, we need to shift the Fibonacci multiplier of the second one by (l2 - r1) to the right , so that we get ![](https://espresso.codeforces.com/f40c2e8970940d059bb115a7a0b9a8b77a492aa9.png)
Shifting can be done by using identity Fn + m = FnFm - 1 + Fn + 1Fm
F[n+m+1] = F[n]*F[m-1] + F[n+1]*F[m] ??
Yes. Proof can be found from matrix exponentiation, or by induction here
Then make 2 segtree, for maintain
(supposed to be
(supposed to be
seg1
) andseg2
).Sorry if this explanation seems unclear. More detail you can check my submission 7338693
wow, I've got it. Thanks you very much :)