I am trying to solve this problem but the dp solution would take O(n^2*k) in both approches top down and bottom up after some search I knew that the solution would be using matrix exponentialtion but I do not know what would be the transtion matrix for this problem https://atcoder.jp/contests/dp/tasks/dp_r
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 161 |
| 3 | maomao90 | 159 |
| 3 | atcoder_official | 159 |
| 5 | cry | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Ahmed_Mahboub | 2020-11-19 13:30:23 | 4 | Tiny change: 'xponential but I do ' -> 'xponentialtion but I do ' | |
| en1 |
|
Ahmed_Mahboub | 2020-11-19 13:29:36 | 342 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/04/2024 14:35:27 (i2).
Desktop version, switch to mobile version.
Supported by
