Can anyone tell me how to solve this problem?
http://codeforces.com/contest/177/problem/G2
Thanks in advance!
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can anyone tell me how to solve this problem?
http://codeforces.com/contest/177/problem/G2
Thanks in advance!
Name |
---|
This is enhanced version of one problem in ICPC WF 2012: https://icpc.kattis.com/problems/fibonacci
Short editorial for WF 2012: http://www.csc.kth.se/~austrin/icpc/finals2012solutions.pdf
I "guess" matrix exponentiation will do the trick for enhanced version (unproven for now, I didn't have time to analyse further).
Let's calculate for each prefix s[1..i] the minimum fibonacci index minind[i] such that s[1..i] is a suffix of fib[i] and s[i + 1..n] is a prefix of fib[i + 1].
Because the relation
can be written equivalently as:
it follows that $min_ind[i]$ is either ∞ or less than n (because fib[i] has all the prefixes of fib[i - 2]). After that, it is essentially a linear reccurence of type
for all $\i \geq n$ (or n + 2 or smth.).
You basically have to compute DP[n] and DP[n + 1] and occurences_less_than_inf, and then do matrix exp. I think that should work :).