can anyone suggest approach to solve this problem?
https://codeforces.com/gym/102157/problem/3
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
can anyone suggest approach to solve this problem?
https://codeforces.com/gym/102157/problem/3
Название |
---|
I think for this problem you're DP state is going to be DP[current index on first row][what elements are matched on bottom row]
We can use a bitmask to represent what elements are matched on the bottom row (with respect to our current index on the first row). Because e <= 4, the we only need to consider "windows" of length 9, so our bit mask goes to 2^9 which is 512. Transitions then become trivial.
I believe the overall complexity is O(N * 2^(2E+1) + N*K).
Thank you...
Can you please elaborate. Can you provide recurrence relation?