Problem link : contest practice Difficulty : Hard Prerequisites : heavylight decomposition, segment trees, persistence Solution : First, let's recall one of the properties of Fibonacci numbers: the nth Fibbonacci number is ax^{n}+(1a)y^{n}, where:
So, the sum of the first K Fibbonacci numbers is basically the sum of two progressions. Now there are still two questions:
The answer to the first quesion is: we don't operate with floating point numbers/doubles at all. This can be achieved this way: since our modulo 1000000009 is a prime, we can find such integer T that its' square modulo 1000000009 is 5. This way we can define sqrt(5) in the modulo ring. Now we have that sqrt(5) is an integer, so all the operations become ordinary modular arithmetic operations. Now we can have a segment tree for the progressions addition. Here is the tutorial on developing such kind of segment trees. When we have a segment tree, it's time to make in persistent and to build the heavylight decomposition of the tree. Pay attention that if you store all the chains of the HLD in the single segment tree, there is no more effort required to maintain the versions of the persistence correctly. But if not, you'll also have to store some persistent array to get access to the right version of some exact chain. Here is the detailed desription of persistent heavylight decomposition's implementation. Setter's solution: link Tester's solution: link
This question is marked "community wiki".
asked 15 Sep '14, 15:37

There is another easy way to update the Segment Tree with the Fibonacci series. Define a new sequence G such that G(1)=F(a)+F(b)+F(c)... for all a,b,c... such that a,b,c are all the starting terms of the sequence added. Similarly for G(2). Clearly G(3)=G(2)+G(1) (The Fibonacci relation still holds.) This can be used to generate the sequence using matrix exponentiation or precomputation. answered 15 Sep '14, 17:57

There are many other approaches for this problem. answered 20 Sep '14, 14:01

thanks for making good question ^_^